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>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
using namespace std;
const int inf = (int)1e9 + 50, mod = 999983ll;
const long long linf = (long long)2e18;
int kob(int x, int y) { return ((long long)x * y) % mod; }
int aza(int x, int y) {
  x -= y;
  if (x < 0) return x + mod;
  return x;
}
int kos(int x, int y) {
  x += y;
  if (x >= mod) return x - mod;
  return x;
}
const int maxn = (int)1e5 + 777, maxn2 = (int)2e7;
char ch[maxn];
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> ch[i];
  for (int i = 1; i <= n; ++i) {
    if (n % i == 0) {
      reverse(ch + 1, ch + i + 1);
    }
  }
  for (int i = 1; i <= n; ++i) cout << ch[i];
  return 0;
}
