|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||16 MB||0||0||0||0.000%|
Lukas loves playing card games. He plays with his friends few times a year and it’s always great fun for him. He always wins a lot of money. And when he doesn’t win, the fun is worth the money he lost. But now he is here in Prague and no one from national leaders can play the card games that he wants to play. He is bored and he invented a new way of shuffling the cards.
Suppose that there are N cards numbered from 1 to N in a pile (in some order). There will also be a second pile that is initially empty. We will perform exactly N operations. In the k-th operation we move pk − 1 cards one by one from the top to the bottom of the first pile and then place one card from the top of the first pile onto the second pile. Number pk is the k-th prime. For example if the cards are in order 1, 2, 3, 4, 5, 6, 7 after the first 2 operations, then after performing the third operation (p3 = 5) the new order is 6, 7, 1, 2, 3, 4. That’s because we moved first 4 cards from the top to the bottom of the first pile and placed the card 5 on the top of the second pile.
Lukas wants to arrange the cards in the first pile in such way that after performing all operations the second pile will contain cards in order N, . . . , 1 (where card number 1 is at the bottom).
The input consists of one integer N – the number of cards in the Lukas’s pile. You can assume that N is at least 2 and at most 100 000.
Output consists of N lines. The i-th line contains one integer ai – the card number that is at position i in the first pile. The position i is the top card and position N is the bottom card of the pile.
2 1 3 4
The first four primes are 2, 3, 5 and 7. This is how the pile looks like during the four steps when the cards in the pile are initially in order 2, 1, 3, 4: (2, 1, 3, 4) → (3, 4, 2) → (3, 4) → (4). We first move card 2 to the end of the pile and take 1 from the pile. After the second operation we move card 2 to the second pile, then card 3 and finally card 4.