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.*;
import java.util.*;
import java.lang.*;

public class Rextester{
    public static String reverse(String s,int a,int b){
        String p="";
        for(int i=0;i<a;i++){
            p+=s.charAt(i);
        }
        for(int i=b;i>=a;i--){
            p+=s.charAt(i);
        }
        for(int i=b+1;i<s.length();i++){
            p+=s.charAt(i);
        }
        return p;
    }
    public static void main(String[] args)throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = new Integer(br.readLine());
        String s = br.readLine();
        br.close();
        char word[]=new char[n];
        String b="";
        int[] divisors = new int[n];
        Arrays.fill(divisors,0);
        divisors[0]=n;
        int p=0;
        for(int i=2;i<=n/2;i++){
            if(n%i==0){
                divisors[p++]=i;
            }
        }
        divisors[p++]=n;
        for(int i=0;i<p;i++){
            s=reverse(s,0,divisors[i]-1);
            //System.out.println(s);
        }
        System.out.println(s);
    }
}
            
        