407689: GYM102875 C Cats

Little E has $$$n$$$ cathouses in a line. For each integer height between 1 and 20, there are sufficiently many cats with that height. He should choose $$$n$$$ cats to place in these cathouses. Every cathouse should contain exactly one cat. However, these cats have a special habit. For every two different cats with the same height, they can't bear to live adjacently, and they can't bear the height of the shortest cat living in the cathouse between them is greater than or equal to theirs.

It's too hard for Little E to find a scheme to make all the cats living in cathouses satisfied. Can you help him?

The first line contains an integer $$$n\ (1\le n\le 10^5)$$$ — the number of cathouses.

Output $$$n$$$ integers in a line. For the $$$i$$$-th integer, output the height of the cat living in the $$$i$$$-th cathouse. Any scheme which can make all the cats living in cathouses satisfied is acceptable.

1

1

3

1 2 3