#include <iostream>
#include <stdio.h>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
//3:48 PM
int main() {
	int T;
	int number;
	scanf("%d",&T);
	while(T-->0)
	{
		int max=0,number1;
		scanf("%d",&number);
		vector<int>array(10000);
		fill(array.begin(),array.end(),0);
		for(int i=0;i<number;i++)
		{
		scanf("%d",&number1);
		array[number1]++;
		}
		int max1=0,index=0;
		for(int i=0;i<10000;i++)
		if(array[i]>max1)
		{
		max1=array[i];
		index=i;
		}
		printf("%d %d\n",index,max1);
		array.clear();
	}
	return 0;
} //Finish 3:52

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8c3RkaW8uaD4KI2luY2x1ZGUgPGNzdHJpbmc+CiNpbmNsdWRlIDx2ZWN0b3I+CiNpbmNsdWRlIDxhbGdvcml0aG0+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Ci8vMzo0OCBQTQppbnQgbWFpbigpIHsKCWludCBUOwoJaW50IG51bWJlcjsKCXNjYW5mKCIlZCIsJlQpOwoJd2hpbGUoVC0tPjApCgl7CgkJaW50IG1heD0wLG51bWJlcjE7CgkJc2NhbmYoIiVkIiwmbnVtYmVyKTsKCQl2ZWN0b3I8aW50PmFycmF5KDEwMDAwKTsKCQlmaWxsKGFycmF5LmJlZ2luKCksYXJyYXkuZW5kKCksMCk7CgkJZm9yKGludCBpPTA7aTxudW1iZXI7aSsrKQoJCXsKCQlzY2FuZigiJWQiLCZudW1iZXIxKTsKCQlhcnJheVtudW1iZXIxXSsrOwoJCX0KCQlpbnQgbWF4MT0wLGluZGV4PTA7CgkJZm9yKGludCBpPTA7aTwxMDAwMDtpKyspCgkJaWYoYXJyYXlbaV0+bWF4MSkKCQl7CgkJbWF4MT1hcnJheVtpXTsKCQlpbmRleD1pOwoJCX0KCQlwcmludGYoIiVkICVkXG4iLGluZGV4LG1heDEpOwoJCWFycmF5LmNsZWFyKCk7Cgl9CglyZXR1cm4gMDsKfSAvL0ZpbmlzaCAzOjUy

MQo2CjEwMDAwIDEwMDAwIDEyIDM4OSAyMyAyCg==

1
6
10000 10000 12 389 23 2