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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

        int length = Integer.valueOf(reader.readLine());
        char[] encodeSequense = reader.readLine().toCharArray();

        int[] dividers = findDividers(length);

        char[] decodeSequense = encodeSequense;
        for (int i = 0; i < dividers.length; i++) {
            char[] decodePart = reverseArray(decodeSequense, dividers[i]);
            System.arraycopy(decodePart, 0, decodeSequense, 0, decodePart.length);
        }

        System.out.println(String.valueOf(decodeSequense));
    }

    /**
     * Находит все делители числа
     *
     * @param number число
     * @return массив делителей, упорядоченных по возрастанию
     */
    private static int[] findDividers(int number) {
        int[] lowDividersArray = new int[number / 2 + 1];
        int[] highDividersArray = new int[number / 2 + 1];

        int lowDividersIndex = 0;
        int highDividersIndex = number / 2;

        int j;
        int i = 1;
        do {
            j = number / i;
            if (i * j == number) {
                lowDividersArray[lowDividersIndex++] = i;
                if (i != j) {
                    highDividersArray[highDividersIndex--] = j;
                }
            }
        } while (++i < j);

        int lowDividersArrayLength = lowDividersIndex;
        int highDividersArrayLength = number / 2 - highDividersIndex;

        int[] dividerArray = new int[lowDividersArrayLength + highDividersArrayLength];

        System.arraycopy(lowDividersArray, 0, dividerArray, 0, lowDividersArrayLength);
        System.arraycopy(highDividersArray, highDividersIndex + 1, dividerArray, lowDividersIndex, highDividersArrayLength);

        return dividerArray;
    }

    private static char[] reverseArray(char[] srcArray, int length) {
        char[] destArray = new char[length];

        for(int i = 0; i < length; i++) {
            destArray[i] = srcArray[length - 1 - i];
        }

        return destArray;
    }
}
