Loudspeakers

The famous cultural festival of your locality is near and as a member of the committee, you are given the responsibility of arranging loudspeakers for the cultural festival that has to take place. Now, you have arranged N loud-speakers where the ith loudspeaker has loudness or amplitude LOUD[i]. Now when one loudspeaker of loudness Y is kept with another loudspeaker of loudness X, the combined loudness is expressed as Y^X.

So, when N loudspeakers are kept in order A1, A2, A3……….An, the combined loudness will be (A1^(A2^(A3^(...........(An))))). So, your task is to rearrange the loudspeakers such that the combined loudness emitted is maximum.

Example:-

Let, 
N = 3
LOUD = [4, 5, 6]
Answer:- [4, 5, 6]
Explanation:- The answer should be 4,5,6 because out of all the rearrangements that are possible the array [4,5,6] will emit the largest combined loudness. Arrangement 4,5,6 emits an amplitude of 4^5^6 (1152921504606846976) and arrangement 6,5,4 emits an amplitude of 6^5^4 (3656158440062976).

Input Format :

The first line contains a single integer ‘T’ representing the number of test cases. Then each test case follows.

The first line of each test case contains an integer ‘N’ denoting the number of loudspeakers you have.

The third line contains ‘N’ integers of the array ‘LOUD’ denoting the loudness of the speakers.

Output Format :

For each test case, print ‘N’ integers denoting the lexicographically smallest rearrangement of loudspeakers such that they emit the largest combined loudness.

The output of each test case should be printed in a separate line.

Note :

You are not required to print anything, it has already been taken care of. Just implement the function.    

Constraints :

1 <= T <= 5
1 <= N <= 10^5
1 <= LOUD[i] <= 10^9

Note:- Loudspeakers having an amplitude of more than 1 will all have unique amplitudes.

Time Limit = 1 sec