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.
#include <bits/stdc++.h>
using namespace std;
void rev(char ara[], int s, int e) {
  if (s > e) return;
  swap(ara[s], ara[e]);
  rev(ara, s + 1, e - 1);
}
int main() {
  int n;
  char ara[1900];
  scanf("%d", &n);
  scanf(" %s", ara);
  int div[1000];
  int idx = 0, cnt = 0;
  for (int i = 1; i < sqrt(n); i++) {
    if (n % i == 0) {
      div[idx++] = i;
      div[idx++] = n / i;
      cnt += 2;
    }
  }
  if (((int)((int)sqrt(n) * (int)sqrt(n))) == n) {
    div[idx++] = sqrt(n);
    cnt++;
  }
  sort(div, div + cnt);
  for (int i = 0; i < cnt; i++) {
    rev(ara, 0, div[i] - 1);
  }
  printf("%s\n", ara);
  return 0;
}
