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 Example {
    static int[] dp;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        //  int t=sc.nextIn
        int n = sc.nextInt();
        String s = sc.next();
        List<Integer> list = new ArrayList<>();
        for (int i = 2; i * i <= n; i++) {
            if (n % i == 0) {
                if ((n / i) != i) {
                    list.add(n / i);
                    list.add(i);
                } else
                    list.add(i);
            }
        }
         list.add(n);
        Collections.sort(list);

        //   System.out.println(list.toString());
       // StringBuilder ans = new StringBuilder(s);
       // s = ans.reverse().toString();
      //  System.out.println(s);
        for (int i = 0; i < list.size() ;i++) {
            StringBuilder an = new StringBuilder(s.substring(0, list.get(i)));
           // System.out.println(an);
            an = an.reverse();
           // System.out.println(an);
            String sb = s.substring(list.get(i), n);
            an.append(sb);
            s = an.toString();
           // System.out.println(s);


        }
        System.out.println(s);
    }
}
	     		     	   	 	  		  		  	