Wrong Bubble Sort

Jeongyeon learned bubble sort in a school programming class and wanted to put it to use, so she took on a sorting problem on an online judge. The problem was as follows.

"Given a sequence of $N$ numbers $A_0$, $A_1$, $\cdots$, $A_{N-1}$, write a program that sorts them in ascending order."

Jeongyeon thought her code was perfect and submitted it, but unfortunately got "Wrong answer." Her bubble sort code is shown below.

for (int i = N - 1; i > 0; i--) {
    for (int j = i - 1; j >= 0; j--) {
        if (A[j] > A[j + 1]) {
            int tmp = A[j];
            A[j] = A[j + 1];
            A[j + 1] = tmp;
        }
    }
}

Given $N$, construct a counterexample input for Jeongyeon's code. Specifically, build a sequence $A$ of length $N$ that her code does not sort correctly. Every element of $A$ must be an integer from $0$ to $10\,000$, inclusive, and her code must fail to sort the $N$ numbers you output.

Such a sequence exists for every $N$ that satisfies the input constraints. If several sequences work, print any of them.

The first line contains an integer $N$.

On the first line, print $N$ integers $A_0$, $A_1$, $\cdots$, $A_{N-1}$ separated by spaces that satisfy the conditions above.

• $3 \le N \le 1\,000$
• $0 \le A_i \le 10\,000$ ($0 \le i < N$)