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

#F2509. Shifting

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

Shifting

题目描述

B. Shifting
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

John Doe has found the beautiful permutation formula.

Let's take permutation p=p1,p2,...,pn. Let's define transformation f of this permutation:

where k (k>1) is an integer, the transformation parameter, r is such maximum integer that rk≤n. If rk=n, then elements prk+1,prk+2 and so on are omitted. In other words, the described transformation of permutation p cyclically shifts to the left each consecutive block of length k and the last block with the length equal to the remainder after dividing n by k.

John Doe thinks that permutation f(f(...f(p=[1,2,...,n],2)...,n-1),n) is beautiful. Unfortunately, he cannot quickly find the beautiful permutation he's interested in. That's why he asked you to help him.

Your task is to find a beautiful permutation for the given n. For clarifications, see the notes to the third sample.

Input

A single line contains integer n (2≤n≤106).

Output

Print n distinct space-separated integers from 1 to n − a beautiful permutation of size n.

Examples
Input
2
Output
2 1 
Input
3
Output
1 3 2 
Input
4
Output
4 2 3 1 
Note

A note to the third test sample:

  • f([1,2,3,4],2)=[2,1,4,3]
  • f([2,1,4,3],3)=[1,4,2,3]
  • f([1,4,2,3],4)=[4,2,3,1]

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