time limit per test
1 secondmemory limit per test
256 megabytesinput
standard inputoutput
standard outputA string n can be encrypted by the following algorithm:
- iterate over all divisors of 1),
- for each divisor d).
For example, the above algorithm applied to the string d=1).
You are given the encrypted string s always exists and is unique.
Input
The first line of input consists of a single integer n, and it consists only of lowercase Latin letters.
Output
Print a string t.
Examples
input
Copy
10 rocesfedoc
output
Copy
codeforces
input
Copy
16 plmaetwoxesisiht
output
Copy
thisisexampletwo
input
Copy
1 z
output
Copy
z
Note
The first example is described in the problem statement.