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 B{
  public static void main(String[] args){
    Scanner sb = new Scanner(System.in);
    int n;
    n = sb.nextInt();
    char[] s = sb.next().toCharArray();
    for(int i = 0; i<n; i++){
      if(n%(i+1)==0){
        reverse(s, 0, i+1);
      }
    }
    for(int i = 0; i<n; i++){
      System.out.print(s[i]);
    }
    System.out.println();
  }
  public static void reverse(char[] s, int i, int j){
    char[] s_reverse = new char[j-i];
    for(int u = i; u < j; u++){
      s_reverse[u] = s[u];
    }
    for(int u = i; u < j; u++){
      s[u] = s_reverse[j-1-u];
    }
  }
}
