The Little Elephant enjoys recursive functions.

This time he enjoys the sorting function. Let a is a permutation of an integers from 1 to n, inclusive, and ai denotes the i-th element of the permutation. The Little Elephant's recursive function f(x), that sorts the first x permutation's elements, works as follows:

  * If x = 1, exit the function. 
  * Otherwise, call f(x - 1), and then make swap(ax - 1, ax) (swap the x-th and (x - 1)-th elements of a). 



The Little Elephant's teacher believes that this function does not work correctly. But that-be do not get an F, the Little Elephant wants to show the performance of its function. Help him, find a permutation of numbers from 1 to n, such that after performing the Little Elephant's function (that is call f(n)), the permutation will be sorted in ascending order.

Input

A single line contains integer n (1 ≤ n ≤ 1000) — the size of permutation.

Output

In a single line print n distinct integers from 1 to n — the required permutation. Numbers in a line should be separated by spaces.

It is guaranteed that the answer exists.

Examples

Input

1


Output

1 

Input

2


Output

2 1 
# https://codeforces.com/problemset/problem/221/A

"""
a is a permutation of integers from 1 to n
f(x) sorts the first x elements

if x = 1 exit
else call f(x-1) and swap a_{x-1} and a_x

This doesn't actually work, but find a permutation that does for n
"""

import sys

n = int(sys.stdin.readline())

# Answer is just last put to the front
answer = [str((i + n - 1) % (n) + 1) for i in range(n)]

sys.stdout.write(' '.join(answer))

