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 sys import stdin

lines = stdin.readlines()
n = int(lines[0])
t = str(lines[1])[:-1]

def bul(x):
    liste = []
    for i in range(1,int(x**0.5)+1):
        if x % i == 0 and x / i == i:
            liste.append(i)
        elif x % i == 0 and x / i != i:
            liste.append(i)
            liste.append(x/i)
    liste = sorted(liste)
    
    return liste

def reverselist(x,y):
    k1 = x[:y]
    k2 = x[y:]
    k3 = ""
    for i in k1[-1::-1]:
        k3 += i
    return k3+k2

for i in bul(n):
    t = reverselist(t,i)
print t
