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;

/**
 *
 * @author HP
 */
public class Codeforces999B2 {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
        int n,d,i,j;
        char temp;
        String s;
        Scanner input = new Scanner(System.in);
        n = input.nextInt();
        s = input.next();
        char []x = s.toCharArray();
        for(d=1;d<=n;d++){
            if(n%d==0){
                for(i=0;i<d/2;i++){
                   temp = x[i];
                   x[i] = x[d-i-1];
                   x[d-i-1] = temp;
                }
                /*for(j=0;j<x.length;j++)
                {
                    System.out.print(x[j]);
                }
                 System.out.println();*/
            }
        }
        for(j=0;j<x.length;j++)
        {
           System.out.print(x[j]);
        }
    }
    
}
