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.
/*package whatever //do not write package name here */

import java.io.*;
import java.util.*;
public class GFG {
	public static void main (String[] args) {
		//System.out.println("GfG!");
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		String s=sc.next(),ans=s;
		ArrayList<Integer> al1=new ArrayList<>();
		ArrayList<Integer> al2=new ArrayList<>();
		for(int i=1;i<=Math.sqrt(n);i++){
		    if(n%i==0){
		        al1.add(i);
		        if(n/i!=i)
		            al2.add(n/i);
		    }
		}
		for(int i=0;i<al1.size();i++){
		    ans=reverse(ans,al1.get(i));
		}
		for(int i=al2.size()-1;i>=0;i--){
		    ans=reverse(ans,al2.get(i));
		}
		System.out.println(ans);
	}
	public static String reverse(String s,int d){
	    String str="";
	    for(int i=d-1;i>=0;i--)
	        str=str+s.charAt(i);
	    for(int i=d;i<s.length();i++)
	        str=str+s.charAt(i);
	    return str;
	}
}