CF221A.Little Elephant and Function

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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.

输入格式

A single line contains integer $n$ $(1<=n<=1000)$ — the size of permutation.

输出格式

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.

输入输出样例

输入#1
```
1
```
输出#1
```
1 
```
输入#2
```
2
```
输出#2
```
2 1 
```

首页