Little Elephant and Function

题目链接： http://codeforces.com/contest/221/problem/A

Little Elephant and Function

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 a_i 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(a_x - 1, a_x) (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.

Sample test(s)

input

1

output

1 

input

2

output

2 1 

题目大意就是：输入一个N，然后输出第一个数位N，第二位数开始是从1到N-1的递增顺序输出。例如输入的挣整数N是5，那么输出就是5 1 2 3 4 .这么一说就简单了，感觉很水吧，哈哈。

代码：

#include<iostream>using namespace std;int main(){int n;while(cin>>n){cout<<n<<" ";for(int i=1; i<n; i++)cout<<i<<" ";}return 0;}