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.
# Reversing Encryption


def divisors(n):
	divisors = []
	for x in range(1, n//2+2):
		if (n % x == 0):
			divisors.append(x)
	return divisors

def extract(strr, corr, div, i):
	if div[i] == 1:
		return strr

	sliced = strr[div[i]:]
	rem = strr[0:div[i]]
	s = sliced[::-1]	
	i += 1
	corr = s + extract(rem, corr, div, i)
	corr = corr[::-1]
	return corr

# Main

n = input()
rev_v = raw_input()
div =  divisors(n)
div = div[::-1]
corr = ''

if n == 2:
	print rev_v[::-1]
else:
	res = extract(rev_v, corr, div, 0)
	print res[::-1]