CF286B Shifting

John Doe has found the beautiful permutation formula. Let's take permutation $ p=p_{1},p_{2},...,p_{n} $ . 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

A single line contains integer $ n $ ( $ 2

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

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] $