#include <iostream>
#include <fstream>
#include <algorithm>

#define maxN 1000005

using namespace std;

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

int n;
int v[maxN];

int main()
{
    fin>>n;
    for (int i=0; i<n; ++i)
        fin>>v[i];
    sort(v,v+n);
    int i=0;
    while (i<n)
    {
        int j=i;
        while (j<n && v[j+1]==v[i])
            j++;
        if (j-i+1 > n/2) {fout<<v[i]<<' '<<j-i+1; break;}
        i=j+1;
    }
    return 0;
}