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.BufferedWriter;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Arrays;
import java.util.BitSet;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Vector;

/**
 *
 * @author user
 */
public class JavaApplication8 {

    public static String reverse(String s,int pos){
        StringBuffer str = new StringBuffer() ;
        
        for(int i=pos-1;i>=0;i--){
            str.append(s.charAt(i));
        }
        
        return str.toString() + s.substring(pos) ;
        
    }
    
    public static void main(String[] args) throws IOException {
        
       Scanner in = new Scanner(System.in) ;
       int n = in.nextInt() ;
       String s = in.next() ;
       String get = s ;
       for(int i=2;i<=n;i++){
           if(n % i == 0 ){
               get = reverse(get,i) ;
           }
       }
       
       System.out.println(get) ;
    }
}
