#include <fstream>
#include <iostream>
#include <algorithm>
using namespace std;

ifstream in("elmaj.in");
ofstream out("elmaj.out");

const int N=1000001;
int contor;
int v[N],n;
int elmaj (int n, int v[])
{
    int i = 0;
    while (i < n)
    {
        int j=i;
        while ((j<n) && (v[j+1] == v[i]))
              j++;
        if (n/2<j-i+1){
            contor=j-i+1;
              return v[i];
        }
        i= j + 1;
    }
    return -1;
}
int main(){
	int i;
	in>>n;
	for(i=1;i<=n;++i){
		in>>v[i];
	}
    sort(v+0,v+n+1);
	out<<elmaj(n,v);
	out<<" "<<contor;
	return 0;
}