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.util.*;
import java.io.*;
import java.text.*;
import java.math.*;
import static java.lang.Integer.*;
import static java.lang.Double.*;
import static java.lang.Math.*;

public class reversing_encryption
{

	public static void main(String[] args) throws Exception
	{
		new reversing_encryption().run();
	}

	public void run() throws Exception
	{
		FastIO file = new FastIO();
		int d = file.nextInt();
		
		ArrayList<Integer> divisors = new ArrayList<>();
		int dcopy = d;
		for (int n = 2; n <= d; n++)
		{
			if (d % n == 0) divisors.add(n);
		}
		String str = file.next();
		int i = 0;
		while (i < divisors.size())
		{
			String s = "";
			int c = divisors.get(i);
			s += reverse(str.substring(0, c));
			s += str.substring(c);
			str = s;
			i++;
		}
		System.out.println(str);
	}
	
	String reverse(String s)
	{
		String str = "";
		for (char c : s.toCharArray()) str = c + str;
		return str;
	}
	
	public static class FastIO
	{
		BufferedReader br;
		StringTokenizer st;

		public FastIO()
		{
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String next()
		{
			while (st == null || !st.hasMoreElements())
			{
				try
				{
					st = new StringTokenizer(br.readLine());
				} catch (IOException e)
				{
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

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

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

		double nextDouble()
		{
			return Double.parseDouble(next());
		}

		String nextLine()
		{
			String str = "";
			try
			{
				str = br.readLine();
			} catch (IOException e)
			{
				e.printStackTrace();
			}
			return str;
		}
	}
}