codeforces——B. Reversing Encryption

 

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

A string ss of length nn can be encrypted by the following algorithm:

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

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 tt . Your task is to decrypt this string, i.e., to find a string ss such that the above algorithm results in string tt . It can be proven that this string ss always exists and is unique.

Input

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

Output

Print a string ss such that the above algorithm results in tt .

Examples

Input

Copy

10
rocesfedoc

Output

Copy

codeforces

Input

Copy

16
plmaetwoxesisiht

Output

Copy

thisisexampletwo

Input

Copy

1
z

Output

Copy

z

B. Reversing Encryption

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

A string ss of length nn can be encrypted by the following algorithm:

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

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 tt . Your task is to decrypt this string, i.e., to find a string ss such that the above algorithm results in string tt . It can be proven that this string ss always exists and is unique.

Input

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

Output

Print a string ss such that the above algorithm results in tt .

Examples

Input

Copy

10
rocesfedoc

Output

Copy

codeforces

Input

Copy

16
plmaetwoxesisiht

Output

Copy

thisisexampletwo

Input

Copy

1
z

Output

Copy

z

  No time to write way to think,it  is easy  to know it  while you know the question and  look at my code;

#include<bits/stdc++.h>
using namespace std;
int a[108];
char s[108];
int main()
{
    int n,j=1;
    string temp;
    scanf("%d",&n);


    for(int i=1;i<=n;i++)
    {
        cin>>s[i];
        if(n%i==0&&i!=1)
        {
            a[j]=i;
            j++;
        }
    }
    j--;
    for(int i=1;i<=j;i++)
    {
        reverse(s+1,s+1+a[i]);
    }
    for(int  i=1;i<=n;i++)
        cout<<s[i];
    return 0;
}