Problem: Write a program to find the mode of a given list of integers. Mode of a number is defined as the number which is most frequently occured. 
For example: 
L = {1,2,2,3} // Here mode is 2(most frequently occured)  

It is possible that multiple answers are possible for a list. In that case print all possible answers in non-increasing order.

Input:
First Line of input contains an integer t represeting the number of test cases, Where first line of each test case has an integers N - number of integers in list, Next line contains N integers.

Output:
print all the possible modes in non-increasing order.

Constraints:
1 ≤ t ≤ 100
1 ≤ N<100000
1 ≤ a[i] ≤ 1000000

SAMPLE INPUT
2
5
1 2 2 2 2 
6
1 2 2 3 3 4

SAMPLE OUTPUT
2 
3 2

Solution (in PYTHON):

Solution:
test_cases=input()
while test_cases>0:
    num_of_integers=input()
#    li = [0]*1000001	
    a=list(map(int,raw_input().split()))
    b=[0]*len(a)	
    mydict=dict(zip(a,b))
#    print mydict	
    if len(a)==num_of_integers:	
        for i in a:
#            li[i]=li[i]+1
            mydict[i]+=1			
    else:
        print"wrong input"
        break		
    test_cases=test_cases-1
#    highest=max(li)
    highest=max(mydict.values())
    sorted_array=sorted([k for k,v in mydict.items() if v == highest])[::-1]		
    print ' '.join([str(j) for j in sorted_array])