Minimize Inconvenience

In a competitive event, participants are assigned unique IDs from 1 to \(N\). The total inconvenience is defined in such a way that arranging the participants in increasing order minimizes this inconvenience. In essence, the optimal order of participants is simply the sequence \(1, 2, \dots, N\).

Your task is to compute this optimal ordering given the number of participants \(N\).

inputFormat

The input consists of a single integer \(N\) representing the number of participants.

Constraints: \(1 \leq N \leq 10^5\).

outputFormat

Output a single line containing \(N\) space-separated integers which represent the participants' IDs in the optimal order.

1

1