Print at Least Once

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem Statement

Given a nonnegative integer $n$, print $n,n-1,\ldots,0$ in decreasing order, one number per line. If $n=0$, still print one line containing $0$.

Input

One line contains the integer $n$.

Output

Print $n+1$ lines in decreasing order from $n$ to $0$.

Subtasks

• Subtask 1 (20%): $0\le n\le4$.
• Subtask 2 (30%): $0\le n\le11$.
• Subtask 3 (50%): $0\le n\le20$.

Examples

Example 1

Input

0

Output

0

Explanation

The first pass prints 0, then decrements to -1. The next condition is false.

Example 2

Input

3

Output

3
2
1
0

Explanation

The loop prints 3, 2, 1, 0; after printing 0, it decrements to -1 and stops.