Vasya bought the collected works of a well-known Berland poet Petya in n volumes. The volumes are numbered from 1 to n. He thinks that it does not do to arrange the book simply according to their order. Vasya wants to minimize the number of the disposition’s divisors — the positive integers i such that for at least one j (1 ≤ j ≤ n) is true both: j mod i = 0 and at the same time p(j) mod i = 0, where p(j) is the number of the tome that stands on the j-th place and mod is the operation of taking the division remainder. Naturally, one volume can occupy exactly one place and in one place can stand exactly one volume.

Help Vasya — find the volume disposition with the minimum number of divisors.

Input

The first line contains number n (1 ≤ n ≤ 100000) which represents the number of volumes and free places.

Output

Print n numbers — the sought disposition with the minimum divisor number. The j-th number (1 ≤ j ≤ n) should be equal to p(j) — the number of tome that stands on the j-th place. If there are several solutions, print any of them.

Examples

Input

2


Output

2 1 


Input

3


Output

1 3 2 
import javax.swing.event.ListDataEvent;
import java.io.*;
import java.math.BigInteger;
import java.util.*;

public class J implements Runnable {

    private static final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;

    private BufferedReader in;
    private PrintWriter out;
    private StringTokenizer tok = new StringTokenizer("");

    private void init() throws FileNotFoundException {
        Locale.setDefault(Locale.US);
        String fileName = "";
        if (ONLINE_JUDGE && fileName.isEmpty()) {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
        } else {
            if (fileName.isEmpty()) {
                in = new BufferedReader(new FileReader("input.txt"));
                out = new PrintWriter("output.txt");
            } else {
                in = new BufferedReader(new FileReader(fileName + ".in"));
                out = new PrintWriter(fileName + ".out");
            }
        }
    }

    String readString() throws IOException {
        while (!tok.hasMoreTokens()) {
            tok = new StringTokenizer(in.readLine());

        }
        return tok.nextToken();
    }

    int readInt() throws IOException {
        return Integer.parseInt(readString());
    }

    long readLong() throws IOException {
        return Long.parseLong(readString());
    }

    double readDouble() throws IOException {
        return Double.parseDouble(readString());
    }

    int[] readIntArray(int size) throws IOException {
        int[] a = new int[size];
        for (int i = 0; i < size; i++) {
            a[i] = readInt();
        }
        return a;
    }

    public static void main(String[] args) {
        //new Thread(null, new _Solution(), "", 128 * (1L << 20)).start();
        new J().run();
    }

    long timeBegin, timeEnd;

    void time() {
        timeEnd = System.currentTimeMillis();
        System.err.println("Time = " + (timeEnd - timeBegin));
    }

    @Override
    public void run() {
        try {
            timeBegin = System.currentTimeMillis();
            init();
            solve();
            out.close();
            time();
        } catch (Exception e) {
            e.printStackTrace();
            System.exit(-1);
        }
    }

    int calc(int[] a) {
        if (a == null) return Integer.MAX_VALUE;
        int res = 0;
        for (int i = 1; i <= a.length; i++) {
            boolean x = false;
            for (int j = 1; j <= a.length; j++) {
                if (j % i == 0 && a[j - 1] % i == 0) x = true;
            }
            if (x) res++;
        }
        return res;
    }

    int[] a;
    int[] best;

    void brut(int pos) {
        if (a.length == pos) {
            if (calc(a) < calc(best)) {
                best = a.clone();
            }
            return;
        }
        for (int i = pos; i < a.length; i++) {
            int t = a[i];
            a[i] = a[pos];
            a[pos] = t;
            brut(pos + 1);
            t = a[i];
            a[i] = a[pos];
            a[pos] = t;
        }
    }

    void solve() throws IOException {
        int n = readInt();
        if (n % 2 == 0) {
            for (int i = 2; i <= n; i += 2) {
                out.print(i + " " + (i - 1) + " ");
            }
        } else {
            out.print("1 ");
            for (int i = 3; i <= n; i += 2) {
                out.print(i + " " + (i - 1) + " ");
            }
        }
//        int n = 7;
//        a = new int[n];
//        for (int i = 0; i < n; i++) {
//            a[i] = i + 1;
//        }
//        brut(0);
//        System.err.println(calc(best));
//        System.err.println(Arrays.toString(best));
    }


}