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 newstring(s, d):
    start = 0
    end = d-1
    s = list(s) # string is  abc, I converted this to ['a','b','c'], so accessing easier.
    while start <= end:
        s[start],s[end] = s[end],s[start]
        start += 1
        end -= 1
    return ("".join(s))    # joining the newly modified list

if __name__ == "__main__":
    n = int(input())
    s = input()
    if n in [1,2]:
        print(s[::-1])
    else:
        # find divisors of n backwards
        for d in range(1,n+1):
            if n%d == 0:
                s = newstring(s, d)
        print(s)            