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 s="codeforces" leads to the following changes: "codeforces" → "secrofedoc" → "orcesfedoc" → "rocesfedoc" → "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 ≤ 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

Note

The first example is described in the problem statement.
def factors(n):
    l=[]
    for i in range(2,int(n**(1/2))+1):    #Py3.6 for int div ... in Py2.7 (1/2.0)
        if n%i==0:
            l.append(i)
            if i*i!=n:
                l.append(int(n/i))
    l.sort()
    return l


n=int(input())
if n>=1 and n<=100:
    t=input().rstrip().lower()
    if len(t)==n:
        f=factors(n)
        for i in f:
            s=list(t[:i])
            s.reverse()
            e=t[i:]
            s1=''
            for x in s:
                s1=s1+x
            t=s1+e
        t=t[::-1]
        print(t)
