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.io.*;

public class jjkj {
    static String[] letters;
    public static void main(String[] args) throws IOException {
        //Scanner input = new Scanner(new BufferedReader(new FileReader("{NAME}.in")));
        //PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("{NAME}.out")));
        Scanner input = new Scanner(System.in);
        int n = Integer.parseInt(input.nextLine());
//        input.next();
        input.useDelimiter("||\n");
        letters = new String[n];
        for (int i = 0; i < n; i++){
            letters[i] = input.next();
//            System.out.println(letters[i]);
        }
//        System.out.println(Arrays.toString(reverse(0)));


        LinkedList<Integer> check = new LinkedList<>();
        for (int i = 1; i <= Math.sqrt(n); i++){
            if (n % i == 0){
                check.add(i);
                if (i != n/i){
                    check.add(n/i);
                }
            }
        }
//        System.out.println(check.toString());
        Collections.sort(check);
//        System.out.println(Arrays.toString(letters));
        for (int i :check){
            reverse(i);
//            System.out.println(Arrays.toString(letters));
        }
        String ans = "";
        for (String i : letters){
            ans+=i;
        }
        System.out.println(ans);
    }
    public static String[] reverse(int upper){
//        System.out.println(Math.ceil((0+upper+1)/2));
        for (int i = 0; i < Math.ceil((0+upper+1)/2); i++){
            String temp = letters[i];
            int l = upper-i-1;
            letters[i] = letters[l];
            letters[l] = temp;
//            System.out.println("i "+i+" a[i]" +letters[i]+" a[a.length-1-i "+letters[l]);
        }
        return letters;
    }
}
