/*
    Name: NYOJ--95--众数问题
    Date: 20/04/17 16:02
    Description: multiset水过
*/
#include<set>
#include<iostream>
using namespace std;
multiset<int> st;
int main(){
    ios::sync_with_stdio(false);
    int n;cin>>n;
    while(n--){
        st.clear();
        int m;cin>>m;
        ; i<m; ++i){
            int a;cin>>a;
            st.insert(a);
        }
        int max_val,ct,k;
        max_val = ;ct = ;
        for(multiset<int>::iterator it=st.begin(); it!=st.end(); ++it){
            if((*it) >= max_val){
                if((k = st.count((*it))) > ct) {
                    max_val = (*it);
                    ct = k;
                }
            }
        }
        cout<<max_val<<" "<<ct<<endl;
    }
    ;
}