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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
import java.util.PriorityQueue; 
import java.util.Vector; 
import java.util.ArrayList; 
import java.util.Iterator; 
import java.util.List; 
import java.util.HashSet; 
import java.util.Map; 
import java.util.TreeMap;
import java.util.Collections; 
import java.util.Comparator; 
import java.util.*; 

public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskA solver = new TaskA();
        // int t = in.nextInt();
        // for (int i = 1; i <= t ; i++) {
        //     solver.solve(1, in, out);
        // }
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskA {
        public void solve(int testNumber, InputReader in, PrintWriter out) { 
            int n = in.nextInt(); 
            out.print(n);
            for (int i = 1; i < n; i++) {
                out.print(" " + i);
            }
        }

        static long mod = 1000000007;
        public static long pow(long x, long y) {
            long result = 1;  // initialize result

            x = x % mod;  // update x if it is more than or equal to mod

            if (x == 0) {
                return 0;  // incase x is divisible by mod 
            }

            while (y > 0) {

                // if y is odd, multiply x with result 
                if ((y & 1) != 0) {
                    result = (result * x) % mod; 
                }

                // y must be even now
                y = y >> 1; 
                x = (x * x) % mod; 
            }
            return result; 
        }
        
    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}