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
import operator

t = int(input())
for _ in range(t):
    d = {}
    n = int(input())
    list = raw_input().split()
    for a in list:
        if a in d:
            d[a] += 1
        else:
            d[a] = 1

    d = sorted(d.items(), key=operator.itemgetter(1))
    l = []
    max = d[len(d)-1][1]
    for f in reversed(d):
        if f[1] == max:
            l.append(int(f[0]))
    for a in reversed(sorted(l)):
        print(a),
    print("")