#t1139. 倒着数数

倒着数数

Counting Down

Problem Description

In the previous problem the loop counted from 11 up to nn. This time we turn it around: count down from nn to 11.

The only thing that changes is the loop itself — start at nn, subtract 11 each step, and stop when you reach 11:

for (int i = n; i >= 1; i--) {
    // i becomes n, n-1, ..., 1 in turn
}

Read a positive integer nn and print the numbers from nn down to 11, one per line.

Input Format

One line containing a positive integer nn.

Output Format

nn lines; the ii-th line holds the ii-th number in descending order.

Sample Input

3

Sample Output

3
2
1

Constraints

For 100% of the test data, 1≤n≤10001 \le n \le 1000.

Hint: make sure the loop condition is i >= 1 and the update is i--. Get both right and counting down is done.