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.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.TreeMap;

public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		Task solver = new Task();
		solver.solve(1, in, out);
		out.close();
	}

	static class Task {
		public void solve(int testNumber, InputReader in, PrintWriter out) {

			int n = in.nextInt();
			String s = in.next();
			for (int i = 2; i <= n; i++) {
				if (n % i == 0) {
					StringBuilder sb = new StringBuilder(s.substring(0, i));
					s = sb.reverse().toString() + s.substring(i);
				}
			}
			out.println(s);

			/*
			 * int n = in.nextInt(); int k = in.nextInt(); TreeMap<Character,
			 * Integer> charMap = new TreeMap<>(); String s = in.next(); for
			 * (int i = 0; i < n; i++) { if (charMap.containsKey(s.charAt(i))) {
			 * charMap.put(s.charAt(i), charMap.get(s.charAt(i)) + 1); } else {
			 * charMap.put(s.charAt(i), 1); } } int sum = 0; List<Character> cs
			 * = new ArrayList<>(); int lastSum = 0; char last = '0'; int
			 * lastCount = 0; for (Character c : charMap.keySet()) { lastSum =
			 * sum; sum += charMap.get(c);
			 * 
			 * if (sum <= k) { cs.add(c); } else { last = c; lastCount = k -
			 * lastSum; break; } } for (char c : cs) { s = s.replaceAll("" + c,
			 * ""); } List<Integer> index = new ArrayList<>(); if (lastCount >
			 * 0) { for (int i = 0; i < s.length(); i++) { if (s.charAt(i) ==
			 * last) { index.add(i); lastCount--; if (lastCount == 0) { break; }
			 * } } } StringBuilder sb = new StringBuilder(s); for (int i =
			 * index.size() - 1; i >= 0; i--) { sb.deleteCharAt(index.get(i)); }
			 * out.println(sb.toString());
			 */

		}
	}

	static class InputReader {
		public BufferedReader reader;
		public StringTokenizer tokenizer;

		public InputReader(InputStream stream) {
			reader = new BufferedReader(new InputStreamReader(stream), 32768);
			tokenizer = null;
		}

		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(next());
		}

		public Long nextLong() {
			return Long.parseLong(next());
		}

	}
}