#include <bits/stdc++.h>
using namespace std;
long long N = 2e5 + 5;
std::vector<int> v;
const int maxn = 1e5 + 5;
int t[maxn], l[maxn];
bool isVowel(char a) {
  if (a == 'a' || a == 'e' || a == 'i' || a == 'o' || a == 'u') return true;
  return false;
}
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9')
    x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
  return x * f;
}
long long INF = 1e9;
int n;
vector<int> ans;
void solve() {
  int n;
  string s;
  cin >> n >> s;
  for (int i = 1; i <= n; ++i) {
    if (n % i == 0) reverse(s.begin(), s.begin() + i);
  }
  cout << s << endl;
}
int main() {
  ios_base::sync_with_stdio(0);
  solve();
}

### Prompt

Develop a solution in cpp to the problem described below:

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.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
long long N = 2e5 + 5;
std::vector<int> v;
const int maxn = 1e5 + 5;
int t[maxn], l[maxn];
bool isVowel(char a) {
  if (a == 'a' || a == 'e' || a == 'i' || a == 'o' || a == 'u') return true;
  return false;
}
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9')
    x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
  return x * f;
}
long long INF = 1e9;
int n;
vector<int> ans;
void solve() {
  int n;
  string s;
  cin >> n >> s;
  for (int i = 1; i <= n; ++i) {
    if (n % i == 0) reverse(s.begin(), s.begin() + i);
  }
  cout << s << endl;
}
int main() {
  ios_base::sync_with_stdio(0);
  solve();
}

```