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 Problem {
    public static void main(String args[]) {
        Scanner sc=new Scanner(System.in);
        int n = sc.nextInt();
        String s = sc.next();
        ArrayList<Integer> al = divisors(n);
        int a[] = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = i;
        }
        for (int i = 0; i < al.size(); i++) {
            a = reverse(a, al.get(i));
        }
        String outp = "";
        for (int i = 0; i < n; i++) {
            outp += s.charAt(a[i]);
        }
        System.out.println(outp);
    }
    public static int[] reverse(int a[], int d) {
        int s = 0;
        int e = d - 1;
        while (s < e) {
            int t = a[s];
            a[s] = a[e];
            a[e] = t;
            s++;
            e--;
        }
        return a;
    }

    public static ArrayList<Integer> divisors(int n) {
        ArrayList<Integer> al = new ArrayList<>();
        Vector<Integer> v = new Vector<>();
        for (int i = 1; i <= Math.sqrt(n); i++) {
            if (n % i == 0) {
                if (n / i == i) // check if divisors are equal
                    al.add(i);
                else {
                    al.add(i);

                    // push the second divisor in the vector
                    v.add(n / i);
                }
            }
        }
        for (int i = v.size() - 1; i >= 0; i--)
            al.add(v.get(i));
        return al;
    }
}
