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 
/*
 Author: Togrul Gasimov
 Mail: ttogrul30@gmail.com 
 */


import java.util.Collection;
import java.util.Comparator;
import java.util.Locale;
import java.util.Scanner;
import java.util.Vector;
import java.util.Arrays;
import java.math.BigInteger;
import java.math.BigDecimal;
import java.util.List;
import java.util.Stack;






public class Main {

 
	static Scanner scan = new Scanner(System.in);

// Function begin
 static long f(long n){
	 long c;
	 double f1=(1+ Math.sqrt(5))/2,f2=(1-Math.sqrt(5))/2;
	 c=Math.round((Math.pow(f1, n) - Math.pow(f2, n))/Math.sqrt(5));
	 return c;
 }
//Function end

 
 
 
//variables begin
//static double PI=3.1415926535897932384626433832795,E=1e-9;
 
 static int n;
//variables end

static void read(){
    n=scan.nextInt();
    
    
}
static void solve(){
	
	System.out.print(n);
	for(int i=1;i<=n-1;i++){
		System.out.print(" " + i);
	}
	System.out.println();
}

 
public static void main(String[] args) {
  read();
  solve();
}
}