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.util.ArrayList;
import java.util.StringTokenizer;


public class ReversingEncryption {
	static class Reader {
		static BufferedReader reader;
 
		static StringTokenizer tokenizer;
		static void init(InputStream input) {
			reader = new BufferedReader(new InputStreamReader(input));
			tokenizer = new StringTokenizer("");
 
		}
 		static String next() throws IOException {
			while (!tokenizer.hasMoreTokens()) {
				tokenizer = new StringTokenizer(reader.readLine());
			}
			return tokenizer.nextToken();
		}
 
		static int nextInt() throws IOException {
			return Integer.parseInt(next());
		}
 
		static long nextLong() throws IOException {
			return Long.parseLong(next());
		}
 
		static double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}
		
	}
	static void reverse(char[] str, int n) {
		for(int i = 0 ; i< n/2 ; i++) {
			char temp = str[i];
			str[i] = str[n-i-1];
			str[n-i-1] = temp;
		}
		
	}
	public static void main(String[] args) throws IOException{
		Reader.init(System.in);
		int n = Reader.nextInt();
		char[] str = Reader.next().toCharArray();
		java.util.List<Integer> divisor = new ArrayList<Integer>();
		for(int i = 2 ; i <= n ; i ++) {
			if(n%i == 0) {
				divisor.add(i);
			}
		}
		for(int i = 0 ; i < divisor.size(); i++) {
			reverse(str, divisor.get(i));
		}
		System.out.println(new String(str));
	}
}


