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.IOException;

public class Main {

	static void reverse(char[] a, int l, int r) {
		if (l >= r) {
			return;
		}
		char temp = a[l];
		a[l] = a[r];
		a[r] = temp;
		reverse(a, l + 1, r - 1);
	}

	public static void main(String[] args) throws IOException {
		MyScanner in = new MyScanner();
		int n = in.nextInt();

		String s = in.next();
		char[] arr = s.toCharArray();
		for (int i = 1; i <= n; i++) {
			if (n % i == 0) {
				reverse(arr, 0, i - 1);
			}
		}
		System.out.println(new String(arr));
	}

	static class MyScanner {
		byte[] buffer = new byte[16384];
		int ptr = buffer.length;
		byte b = 0;

		byte read() throws IOException {
			if (ptr == buffer.length) {
				ptr = 0;
				System.in.read(buffer);
			}
			return buffer[ptr++];
		}

		int nextInt() throws IOException {
			int sign = 1;
			while (b != '-' && (b < '0' || b > '9')) {
				b = read();
			}
			if (b == '-') {
				b = read();
				sign = -1;
			}
			int num = 0;
			while (b >= '0' && b <= '9') {
				num *= 10;
				num += b - '0';
				b = read();
			}
			return num * sign;
		}

		long nextLong() throws IOException {
			long sign = 1;
			while (b != '-' && (b < '0' || b > '9')) {
				b = read();
			}
			if (b == '-') {
				b = read();
				sign = -1;
			}
			long num = 0;
			while (b >= '0' && b <= '9') {
				num *= 10;
				num += b - '0';
				b = read();
			}
			return num * sign;
		}

		String next() throws IOException {
			while (b < 33) {
				b = read();
			}
			StringBuilder sb = new StringBuilder();
			while (b >= 33) {
				sb.append((char) b);
				b = read();
			}
			return sb.toString();
		}
	}

}