Candy Distribution Problem

Given a positive integer $$N$$ representing the number of children, your task is to distribute candies to each child such that every child gets a distinct number of candies and the differences between consecutive distributions are minimized. The optimal solution is to distribute the candies in the sequence $$[1, 2, \ldots, N]$$.

For example, if $$N = 5$$, then the candies should be distributed as: 1, 2, 3, 4, and 5.

inputFormat

Input is a single integer $$N$$, representing the number of children. The input is provided via standard input (stdin).

outputFormat

Output the sequence of $$N$$ integers from 1 to $$N$$ (inclusive), separated by a single space. The output should be sent to standard output (stdout).## sample

2

1 2