PROGRAMMING:Divisor
Given n different positive integers A1, A2, A3... An, please calculate the number of divisors of each number, and sort these positive integers from large to small according to the number of divisors. If the number of divisors of AI and AJ is the same, the smaller one of AI and AJ will be output first.
###Input format:
One integer n in the first line represents the number of positive integers;
The second line contains n positive integers separated by spaces.
###Output format:
Output a total of one line, n positive integers. Note that there are no extra spaces at the end of the line.
###Input example:
```in
five
2 3 4 5 6
```
###Output example:
```out
6 4 2 3 5
```
[example explanation]
6 has four divisors, 1,2,3,6 respectively;
4 has three divisors, 1,2,4 respectively;
There are only two divisors for 2, 3 and 5, which are output from small to large.
[data range]
For 30% data, 1 ≤ n ≤ 1000, 1 ≤ AI ≤ 1000;
For 70% of the data, 1 ≤ n ≤ 10000, 1 ≤ AI ≤ 10000;
For 100% data, 1 ≤ n ≤ 10000, 1 ≤ AI ≤ 1000000.
answer：If there is no answer, please comment
###Input format:
One integer n in the first line represents the number of positive integers;
The second line contains n positive integers separated by spaces.
###Output format:
Output a total of one line, n positive integers. Note that there are no extra spaces at the end of the line.
###Input example:
```in
five
2 3 4 5 6
```
###Output example:
```out
6 4 2 3 5
```
[example explanation]
6 has four divisors, 1,2,3,6 respectively;
4 has three divisors, 1,2,4 respectively;
There are only two divisors for 2, 3 and 5, which are output from small to large.
[data range]
For 30% data, 1 ≤ n ≤ 1000, 1 ≤ AI ≤ 1000;
For 70% of the data, 1 ≤ n ≤ 10000, 1 ≤ AI ≤ 10000;
For 100% data, 1 ≤ n ≤ 10000, 1 ≤ AI ≤ 1000000.
answer：If there is no answer, please comment