跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2706. Little Elephant and Function

  • ID: 2712
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:入门
  • 上传者:
  • 模拟
  • 数学
  • 编程与模拟
  • 入门
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Little Elephant and Function

题目描述

A. Little Elephant and Function
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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 

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 2372 题。保留原作者与原赛事署名。