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.
from math import sqrt
import sys
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def get_ints_lists(): return list(map(int, sys.stdin.readline().strip().split()))
def get_string(): return sys.stdin.readline().strip()
n=int(input())
s=get_string()
if n==1:
    print(s)
elif n==2 or n==3:
    print(s[::-1])
else:
    p=int(sqrt(n))
    li=[]
    for i in range(2,p+1):
        if i*i==n:
            li.append(i)
        elif n%i==0:
            li.append(i)
            li.append(n//i)
    li.sort()
    #print(li)

    #print(s)
    for j in li:
        #print(j)
        s=s[j-1::-1]+s[j:n]
        #print(s)
    s = s[::-1]
    print(s)




	    					  	        		  		 		