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 ReversingEncryption {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt();
		
	    String str = sc.next();
	   
	    StringBuilder sb = new StringBuilder(str);
	    //sb =sb.reverse();
	     
	    ArrayList<Integer> factors = new ArrayList<Integer>();
	   
	    
	    solveFactor(factors, n);
	    factors.add(n);
	    Collections.sort(factors);
	    
	    for(int i = 0; i < factors.size(); i++)
	    {
	    	String tr = sb.substring(0, factors.get(i));
	        StringBuilder st = new StringBuilder(tr);
	        st = st.reverse();
	        String sl = new String(st);
	        sb = sb.replace(0, factors.get(i), sl);
	       // System.out.println(sb.toString());	
	    }
	   // System.out.println(factors);
	    System.out.println(sb.toString());    
	}
	
	public static void solveFactor(ArrayList<Integer> factors, int n)
	{
		for(int i=2; i*i<=n; i++)
		{
			if(n%i ==0)
			{
				if(i != n/i) {
				factors.add(i);
				factors.add(n/i);
				}
				else
				{
					factors.add(i);
				}
			}
		}
	}

}
