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 i in range(T):
	N = int(raw_input())
	a = map(int,raw_input().split())
	
	A = {}
	max = 0
	for k in range(len(a)):
		if a[k] in A:
			A[a[k]] += 1
			if A[a[k]] > max:
				max = A[a[k]]
		else:
			A[a[k]] = 1
	
	B = []
	for k in A:
		if A[k] == max:
			B.append(k)
		

	B = sorted(B, reverse=True)
	for j in range(len(B)):
		print B[j], 
	print