codeforces【B. Reversing Encryption】

题目链接：Reversing Encryption 

 

A string s of length n can be encrypted by the following algorithm:

• iterate over all divisors of n in decreasing order (i.e. from n to 1),
• for each divisor d, reverse the substring s[1…d] (i.e. the substring which starts at position 1 and ends at position d).

For example, the above algorithm applied to the string ss="codeforces" leads to the following changes: "codeforces" →→ "secrofedoc" →→ "orcesfedoc" →→ "rocesfedoc" →→ "rocesfedoc" (obviously, the last reverse operation doesn't change the string because d=1d=1).

You are given the encrypted string t. Your task is to decrypt this string, i.e., to find a string s such that the above algorithm results in string t. It can be proven that this string s always exists and is unique.

Input

The first line of input consists of a single integer n (1≤n≤100) — the length of the string t. The second line of input consists of the string t. The length of t is n, and it consists only of lowercase Latin letters.

Output

Print a string s such that the above algorithm results in t.

Examples

input

10
rocesfedoc

output

codeforces

input

16
plmaetwoxesisiht

output

thisisexampletwo

input

1
z

output

z

 

根据题目可以知道逆转的次数是n的因子数的数量，每次逆转的子串长度都是n的因子，先逆转大因子数子串，然后递减逆转小的。

于是我们用一个数组来存放n的因子。

#include<iostream>
#include<cstring>
using namespace std;
int cnt[50];
int flag_c=-1;  //记录因子数（1不记入）
void Sum_cnt(int n)
{
   for(int i=2;i<=n;++i)
     if(n%i==0) 
        cnt[++flag_c]=i;   //从小到大存放因子
}
int main()
{
    int N;
    cin>>N;  
    Sum_cnt(N);
    string str; 
    cin>>str;
    for(int i=0;i<=flag_c;++i)
    {
        int rem=cnt[i];
        for(int j=0;j<=rem/2-1;++j)
        swap(str[j],str[rem-1-j]);
    }
    cout<<str;
    return 0;
}