Easy Permutation

You are given an integer $N$. Construct any permutation $A$ of $N$ integers such that the value $LCM(1 + A_1 , 2 + A_2, \ldots, N + A_N)$ is **minimised**. Note: - $LCM$ denotes the [least common multiple](https://en.wikipedia.org/wiki/Least_common_multiple) of the integers. - A permutation of $N$ integers contains all integers from $1$ to $N$ exactly once. ### Input - First line will contain