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
T=int(raw_input())

for _ in xrange(0,T):
    N=int(raw_input())
    maxCount=0
    countDict={}
    numList=[int(x) for x in raw_input().split()][:N]
    for num in numList:
        countDict[num]=countDict.get(num,0)+1
        if(maxCount<countDict[num]):
            maxCount=countDict[num]
    
    resultList=[]
    
    for k,v in countDict.iteritems():
        if(v==maxCount):
            resultList.append(k)

    print ' '.join(str(x) for x in sorted(resultList,reverse=True))