e-olymp
Competitions

By steps of 2019 ACM NEERC, Bad Treap

Increasing sines 1

Find and print n integers x1, x2, ..., xn so that this sequence and the sequence of their sines are strictly increasing:

x1 < x2 < ... < xn

sin(x1) < sin(x2) < ... < sin(xn)

Input

One positive integer n (n104).

Output

Print in one line the sequence of integers x1, x2, ..., xn, satisfying the condition of the problem. Members of the sequence by absolute value must be no more than 231 - 1 (|xi| < 231).

Hint

For the given sample sin(-8) < sin(-2) < sin(0) < sin(9) < sin(15) is true since it is equivalent to -0.989 < -0.909 < 0 < 0.412 < 0.650. We have also: -8 < -2 < 0 < 9 < 15.

Time limit 1 second
Memory limit 128 MiB
Input example #1
5
Output example #1
-8 -2 0 9 15
Author Mykhailo Medvediev