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.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.math.BigInteger;
import java.util.Scanner;

import javax.swing.table.DefaultTableModel;

public class Test 
{
    static void print(int[] a)
    {
        for(int i=0;i<a.length;i++) System.out.print(a[i]+" ");
        System.out.println();
    }
    static String space(int n)
    {
        String res="";
        for(int i=0;i<n;i++) res+=" ";
        return res;
    }
    static int sum(int a[])
    {
        int res=0;
        for(int i=0;i<a.length;i++) res+=a[i];
        return res;
    }
    static int[] sort(int list[])
    {
        for(int i=0;i<list.length-1;i++)
        {
            for(int j=0;j<list.length-i-1;j++)
            {
                if(list[j]>list[j+1]) 
                {
                    int t=list[j];
                    list[j]=list[j+1];
                    list[j+1]=t;
                }
            }
        }
        return list;
    }
    public static void main(String args[])
    {
        Scanner in=new Scanner(System.in);
        int n=in.nextInt();
        if(n==1) {System.out.println(1); return;}
        System.out.print(n);
        for(int i=1;i<n;i++) System.out.print(" "+i);
        
        //for(int i=0;i<255;i++) System.out.println(i+" : "+(char)i);
    }
    
}