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 
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.text.DecimalFormat;
import java.util.Scanner;
import java.util.StringTokenizer;
public class A {

	// -- DEBUG switch --
	static final boolean DEBUG = true;
	static DecimalFormat df = new DecimalFormat("#.#");
	static int[][] dir = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}};
	
	static int maxn = 1000;
	static int[] dp = new int[maxn];

	static void f(int n, int[] a){
		if (n == 1) 
			return;
		else{
			f(n-1, a);
			swap(a, n-1, n);
		}
	}
	static void swap(int[] arr, int i, int j){
		int t = arr[i]; arr[i] = j; arr[j] = t;
	}
	// -- -- 

	static void t(){
		for (int j=1; j<=10; j++){
			int n = j;
			int[] arr = new int[n+1];
			for(int i=1; i<=n; i++)
				arr[i] = i;
			f(n, arr);
			dbgArr(arr, 1, n);			
		}
	}
	
	public static void main(String[] args) throws IOException {

//		t();
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		if (n == 1){
			System.out.println(1);
			return;
		}
		

		System.out.print(n);
		for(int i=1; i<n; i++)
			System.out.print(" " + i);

		
		

	}
	
	static BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
	static StringTokenizer st = null;
	
	static void readIntArrays(int n, int[] a) throws IOException {
		for (int i=0; i<n; i++){
			a[i] = i();
		}
	}
	
	static void dbgArr(int[] a, int s, int e){
		if (DEBUG) {
			System.out.println();
			for (int i=s; i<=e; i++)
				System.out.print(a[i] + " ");
			System.out.println();
		}
	}
	
	static void readIntArrays(int n, int m, int[][] a) throws IOException {
		for (int i=0; i<n; i++){
			for (int j=0; j<n; j++)
				a[i][j] = i();
		}
	}
	static void dbgArr(int[][] a, int rs, int re, int cs, int ce){
		if (DEBUG) {
			System.out.println();
			for (int i=rs; i<=re; i++){
				for (int j=cs; j<=ce; j++)
					System.out.print(a[i][j] + " ");
				System.out.println();
			}
			System.out.println();
		}
	}	
	static String s() throws IOException {
		if (st == null || !st.hasMoreTokens())
			st = new StringTokenizer(in.readLine());
		return st.nextToken();
	}
	
	static int i() throws IOException {
		return Integer.parseInt(s());
	}
	
	static int i(String s) {
		return Integer.parseInt(s);
	}
	
	static long l() throws IOException {
		return Long.parseLong(s());
	}
	
	static long l(String s){
		return Long.parseLong(s);
	}
	
	static double d() throws IOException {
		return Double.parseDouble(s());
	}
	static double d(String s)  {
		return Double.parseDouble(s);
	}	
	
	static void p(String args){
		System.out.print(args);
	}
	
	static void p(String format, Object... args) {
		System.out.print(String.format(format, args));
	}
	
	static void dbg(String format, Object... args){
		if (DEBUG)
			System.out.print(String.format(format, args));
	}
	
	static void dbg(String args){
		if (DEBUG)
			System.out.print(args);
	}
	static void dbgln(String format, Object... args){
		if (DEBUG)
			System.out.println(String.format(format, args));
		
	}
	
	static void dbgln(String args){
		if (DEBUG)
			System.out.println(args);
	}
}


