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.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        BReversingEncryption solver = new BReversingEncryption();
        solver.solve(1, in, out);
        out.close();
    }

    static class BReversingEncryption {
        private static String reverse(String str, int end) {
            //[0, end]

            StringBuffer sb = new StringBuffer();

            if (end == str.length() - 1) {
                sb.append(str);
                return sb.reverse().toString();
            }

            for (int i = end; i >= 0; i--)
                sb.append(str.charAt(i) + "");


            String rStr = sb.toString() + str.substring(end + 1, str.length());

            return rStr;
        }

        public void solve(int testNumber, Scanner in, PrintWriter out) {

            int n = in.nextInt();
            in.nextLine();
            String s = in.nextLine();

            for (int i = 2; i <= n; i++) {
                if (s.length() % i == 0) {

                    s = reverse(s, i - 1);
                }
            }

            out.println(s);
        }

    }
}

