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 
//package a221;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;

/**
 * Java template for competitive programming
 *
 * @author Man Parvesh Singh Randhawa
 */
public class Main {
    private static BufferedReader bufferedReader;
    private static PrintWriter out;

    /**
     * Initializes private variables
     *
     * @throws Exception
     */
    private static void init() {
        bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
    }

    /**
     * The end of execution
     */
    private static void end() throws IOException {
        bufferedReader.close();
        out.close();
    }

    /**
     * Parses int from String
     *
     * @param s
     * @return
     */
    private static int parseInt(String s) {
        return Integer.parseInt(s);
    }

    private static void println(String s) {
        out.println(s);
    }

    private static void println(int i) {
        out.println(i);
    }

    /**
     * Reads line and returns as String
     *
     * @return
     * @throws Exception
     */
    private static String readLine() throws IOException {
        return bufferedReader.readLine();
    }

    /**
     * Takes single int input in a line
     *
     * @return
     * @throws Exception
     */
    private static int singleIntInput() throws IOException {
        return parseInt(readLine());
    }

    /**
     * Takes input from line and split using space character as delimiter
     *
     * @return
     * @throws Exception
     */
    private static String[] readLineAndSplitIntoArray() throws IOException {
        return readLine().split(" ");
    }

    /**
     * Takes int array of length n as input from a line
     *
     * @param n
     * @return
     * @throws Exception
     */
    private static int[] intArrayInputFromLine(int n) throws IOException {
        String sar[] = readLineAndSplitIntoArray();
        int ar[] = new int[n];
        for (int i = 0; i < n; i++) {
            ar[i] = parseInt(sar[i]);
        }
        return ar;
    }

    public static void main(String[] args) throws IOException {
        init();

        // main code
        int n = singleIntInput();
        out.print(n + " ");

        for (int i = 1; i <= n-1; i++) {
            out.print(i + " ");
        }

        println("");

        end();
    }
}