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.
#Imports
from sys import stdin, stdout
from collections import Counter, deque
from decimal import *
import math


#Aux
def _find_divisors(number):
	left_divs = []
	right_divs = []

	for i in xrange(2, int(math.sqrt(number))+1):
		if number%i==0:
			left_divs.append(i)
			if i*i != number:
			    right_divs.append(number/i)

	left_divs.extend(right_divs[::-1])
	left_divs.append(number)
	return left_divs


def _decrypt(divisors, string):
	str_list = list(string)

	for div in divisors:
		j = div
		for i in xrange(div/2):
			j-=1
			str_list[i], str_list[j] = str_list[j], str_list[i]

	return ''.join(str_list)


#Main
def _main():
    #Read input
    size = int(stdin.readline().rstrip())
    string = stdin.readline().rstrip()


    #Calculate answer
    divisors = _find_divisors(size)
    converted = _decrypt(divisors, string)


    #Print output
    stdout.write(converted)



#Call
_main()