1393 Why not Ac it


Submit solution

Points: 100
Time limit: 1.0s
Memory limit: 32M

Problem types
Allowed languages
C, C++, Java, Python

Description

To be accepted is not a dream, but I don’t want to “waterify” this question. :-) Hence a compromise needs to be made. Given an integer N, you are asked to print all its positive factors in a consecutive way with small factors occurring before large factors.

Input

The first line of input contains a number T (1<T<50), which is the number of test cases. Each of the following T lines contains a single integer N (1<N<100).

Output

For each test case, print a line the string formed by N’s factors.

Sample

Input

2
12
89

Output

1234612
189

Source: Limitfan


Comments

There are no comments at the moment.