Stand in order#5325

Stand in order

1 second

128 megabytes

Easy

At a session of the Summer Computer School, $n$ schoolchildren are preparing for a parade. They need to stand in an orderly fashion. Upon a given command, they all line up and start counting. The first student in line says "first", the second says "second", and so on. Write the script for this process.

Input

One integer $n (1 \leq n \leq 1000)$ n~(1 \le n \le 1000).

Output

Print all the numbers from $1$ to $n$ in a single line.

Examples

Example 1

Loading

Example 2

Loading

n (1 \leq n \leq 1000)