Create a sequence a_1, a_2, ..., a_n, consisting of elements, such that the following conditions are true:
< a_1 < a_2 < ... < a_n < 10^6,
ld(a_1) = fd(a_2), ld(a_2) = fd(a_3), ..., ld(a_{n-1}) = fd(a_n). Here stands for the last digit of and stands for the first digit of . In other words, the first digit of each element, starting from the 2nd element in this sequence, must be equal to the last digit of the previous element. Note that numbers cannot start with .
One integer ( ≤ ≤ 10^5).
Print any sequence a_1, a_2, ..., a_n in one line that satisfies the condition of the problem.
It is guaranteed that such a sequence always exists under the given conditions.
Example 1
Example 2