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.*;
import java.lang.Math.*;
import java.io.*;
public class B999{
	public static void main(String[] args) throws FileNotFoundException,IOException{
	//reading from file	
//	File rf = new File("input.txt");
//	FileReader fr = new FileReader(rf);
//	BufferedReader br  = new BufferedReader(fr);
	BufferedReader br=new BufferedReader(new InputStreamReader(System.in));

	//writing file
//	PrintStream o = new PrintStream(new File("output.txt"));
//    PrintStream console = System.out;
//    System.setOut(o);

    int n=Integer.parseInt(br.readLine());
    String s=br.readLine();
    ArrayList<Integer> pro =new ArrayList<Integer>();
    for(int i=2;i<=Math.sqrt(n);i++){
    	if(n%i==0){
    		pro.add(i);
    		if(i!=n/i)
    		pro.add(n/i);
    	}
    }
    Collections.sort(pro);
    StringBuilder sb=new StringBuilder(s);
 //   sb=sb.reverse();
    //System.out.println(sb.toString());
    for(int i=0;i<pro.size();i++){
		sb=new StringBuilder(sb.substring(0,pro.get(i))).reverse().append(sb.substring(pro.get(i)));
    //	System.out.println(sb.toString());
    }
    System.out.println(sb.reverse().toString());
	}
}
