|Codeforces Round #191 (Div. 2)|
Iahub and Iahubina went to a date at a luxury restaurant. Everything went fine until paying for the food. Instead of money, the waiter wants Iahub to write a Hungry sequence consisting of n integers.
A sequence a 1, a 2, ..., a n, consisting of n integers, is Hungry if and only if:
Iahub is in trouble, so he asks you for help. Find a Hungry sequence with n elements.
The input contains a single integer: n (1 ≤ n ≤ 105).
Output a line that contains n space-separated integers a 1 a 2, ..., a n (1 ≤ a i ≤ 107), representing a possible Hungry sequence. Note, that each a i must not be greater than 10000000 (107) and less than 1.
If there are multiple solutions you can output any one.
2 9 15
11 14 20 27 31