eolymp
bolt
Try our new interface for solving problems
Problems

Sequence - 2

Sequence - 2

Time limit 1 second
Memory limit 64 MiB

Display a sequence of numbers. We assume that n is the number of the variant.

n = 1: 1 4 9 16 25 36 49 64 81 100

n = 2: 1 8 27 64 125 216 343 512 729 1000

n = 3: 2 5 10 17 26 37 50 65 82 101

n = 4: 2 6 12 20 30 42 56 72 90 110

n = 5: 2 4 8 16 32 64 128 256 512 1024

n = 6: 1 2 6 24 120 720 5040 40320 362880 3628800

Input data:

One number n, 1 ≤ n ≤ 6

Output data

Print the numbers of the sequence

Examples

Input example #1
1
Output example #1
1 4 9 16 25 36 49 64 81 100