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.
import java.util.*;

public class Main {
	
	static void rev (char[] arr, int i, int j) {
		char temp;
		while (i < j) {
			temp = arr[i];
			arr[i] = arr[j];
			arr[j] = temp;
			i++; j--;
		}
	}
	
	public static void main (String[] args) {
		Scanner sc = new Scanner (System.in);
		int n = sc.nextInt ();
		sc.nextLine ();
		char[] arr = sc.nextLine ().toCharArray ();
		
		ArrayList<Integer> divisors = new ArrayList <>();
		divisors.add (1);
		divisors.add (n);
		int lim = n;
		for (int i = 2; i < lim; i++) {
			if (n % i == 0) {
				divisors.add (i);
				lim = n / i;
				if (lim > i)
					divisors.add (lim);
			}
		}
		divisors.sort ((a, b) -> Integer.compare(b, a));
		
		for (int i = divisors.size () - 1; i >= 0; i--) {
			// System.out.println (divisors.get (i));
			rev (arr, 0, divisors.get (i) - 1);
		}
		
		System.out.println (new String (arr));
	}
	
}