Minimized Sum Starting Times

Given an integer \(n\) representing the number of teams, assign each team a distinct positive starting time such that the total sum of starting times is minimized. The optimal assignment is to use the first \(n\) positive integers: \(1, 2, 3, \dots, n\).

Your task is to output these starting times in order, separated by a single space.

inputFormat

A single integer (n) ((1 \le n \le 10^6)) is given on standard input.

outputFormat

Output (n) distinct positive integers in increasing order, separated by a space, representing the starting times.## sample

1

1