CoderForces999B- Reversing Encryption

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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\dots d]$ (i.e. the substring which starts at position $1$ and ends at position $d$).

For example, the above algorithm applied to the string $s$="codeforces" leads to the following changes: "codeforces" $\to$"secrofedoc" $\to$ "orcesfedoc" $\to$ "rocesfedoc" $\to$ "rocesfedoc" (obviously, the last reverse operation doesn't change the string because $d=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\le n\le 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

Copy

10
rocesfedoc

output

Copy

codeforces

input

Copy

16
plmaetwoxesisiht

output

Copy

thisisexampletwo

input

Copy

1
z

output

Copy

z

Note

The first example is described in the problem statement.

ac代码为：

#include<bits/stdc++.h>
using namespace std;
char s1[110],s2[110];
void work(char *s1,int l,int r)
{
    int temp=r;
    for(int i=l;i<=r;i++) s2[temp--]=s1[i];
    for(int i=l;i<=r;i++) s1[i]=s2[i];
}
int main()
{
    int n;
    scanf("%d",&n);
    scanf("%s",s1+1);
    for(int i=1;i<=n;i++)
    {
        if(n%i==0) work(s1,1,i);    
    }
    printf("%s\n",s1+1);
    return 0;
}