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.*;
import java.util.*;
public class Main {

	public static void main(String [] args)throws IOException
	{
		FastReader sc = new FastReader();
		
		int n = sc.nextInt();
		String s = sc.nextLine();
		char [] c = s.toCharArray();
		for (int i =2;i<=n;i++) {
			if (n%i==0) {
				
				int j=0,k=i-1;
				while(j<k) {
					char temp = c[j];
					c[j] = c[k];
					c[k] = temp;
					j++;
					k--;
				}
				
			}
		}
		for (int i =0;i<n;i++)
			System.out.print(c[i]);
	}
	
	public static int gcd(int a,int b) 
	{
		
		if (a==0 || b==0)
			return 0;
		while(b!=0) {
			int temp = b;
			b = a%b;
			a = temp;
		}
		return a;
	}
	
	static class Pair implements Comparable<Pair>
	{
		int a,b;
		
		public Pair(int a,int b) {
			this.a = a;
			this.b = b;
		}
		
		public int compareTo(Pair p) {
			return this.a - p.a;
		}
	}
	
}

 class FastReader
 {
	 
	 BufferedReader br;
	 StringTokenizer st;
	 
	public FastReader() 
	{
		 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;
    }
	
}
