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.*;
import java.io.*;
public class Main12{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        String s = sc.next();
        ArrayList<Integer> arr = factors(n);
        Collections.sort(arr);
        /*for(int i=0;i<arr.size();i++){
        	System.out.print(arr.get(i) + " ");
        }
        */
        for(int i=0;i<arr.size();i++){
            int p  = arr.get(i);
            if(p==n){
                StringBuilder s1 = new StringBuilder();
                s1.append(s);
                s1.reverse();
                s = s1.toString();
            }
            else{
                s = reverse(s,p) + s.substring(p,s.length());
            }
           // System.out.println(s);
        }
       System.out.println(s);
    }
    static ArrayList<Integer> factors(int n){
        ArrayList<Integer> arr = new ArrayList<Integer>();
        for(int i=1 ;i*i<=n;i++){
            if(n%i==0){
                arr.add(i);
                if(n/i!=i){
                    arr.add(n/i);
                }
            }
        }

        return arr;
    }
    static String reverse(String s, int p){
        String r = s.substring(0,p);
        StringBuilder s1 = new StringBuilder();
        s1.append(r);
        s1.reverse();
        return s1.toString();
    }
}
