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.
//package com.company;//package com.company;

import java.io.*;
import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Main {
    static StringTokenizer st;
    static BufferedReader br;

    static String nextToken() {
        try {
            while (st == null || !st.hasMoreTokens()) {
                st = new StringTokenizer(br.readLine());
            }
        } catch (Exception e) {
            e.printStackTrace();
        }
        return st.nextToken();
    }

    static int nextInt() {
        return Integer.parseInt(nextToken());
    }

    static Long nextLong() {
        return Long.parseLong(nextToken());
    }

    static char nextChar() throws IOException {
        return (char) br.read();
    }

    static double nextDouble() {
        return Double.parseDouble(nextToken());
    }

    static String nextLine() throws IOException {
        return br.readLine();
    }

    public static void main(String[] args) throws IOException {
        br = new BufferedReader(new InputStreamReader(System.in));//new FileInputStream("input.txt")));
        //PrintWriter pw = new PrintWriter(new FileWriter("output.txt"));
        int n = nextInt();
        String s = nextLine();

        ArrayList<Integer> a = new ArrayList<>();
        for (int i = 2; i < n; i++) {
            if(n % i == 0){
                StringBuffer str = new StringBuffer(s.substring(0,i));
                s =  str.reverse() + s.substring(i);

            }
        }StringBuffer str = new StringBuffer(s);
        System.out.println(str.reverse());

    }
}

class Pairs implements Comparable<Pairs> {
    int x;
    int y;
    int h;
    int niz;

    public Pairs(int x, int y) {
        this.x = x;
        this.y = y;
    }

    public Pairs() {
    }

    @Override
    public int compareTo(Pairs o) {
        return 0;
    }
}