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.Scanner;

public class ReversingEncryption {
	
	public static void main(String args[]) {
		Scanner in = new Scanner(System.in);
		
		int  n =in.nextInt();
		
		in.nextLine();
		String s= in.nextLine();
		char[] c = new char[n];
		c=s.toCharArray();
		
		int[] ar = new int[n];
		int i;
		i=1;
		int k =0;
		for(i=1;i<=n;i++) {
			if(n%i==0) {
				ar[k]=i;
				k++;
			}
		}
		int sar = k--;
//		System.out.println(sar);
//		System.out.println(k);
		k=1;
		while(k<sar) {
			int nu = ar[k];
			k++;
			int h=nu/2;
			if(nu%2==0)
				h--;
			int j=0;
			nu--;
			while(j<=h) {
//				System.out.println(c[j]);
//				System.out.println(c[nu-j]);
				char a=(char) c[j];
				c[j]=c[nu-j];
				c[nu-j]=a;
				//				char b = c[nu-j];
//				c[j]=b;
//				c[nu-j]=a;
				j++;
			}
			
		}
		
		for(i=0;i<n;i++)
			System.out.print(c[i]);
		
		
		
		
	}
	
}
