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

using namespace std;

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

int v[111111];

int main()
{
    int n,i,k;
    in>>n;
    for(i=1;i<=n;++i)
    {
        in>>v[i];
    }
    sort(v+1,v+n+1);
    k=1;
    for(i=2;i<=n;++i)
    {
        if(v[i]==v[i-1])
        {
            k++;
        }
        else
        {
            if(k>n/2)
            {
                out<<v[i-1]<<" "<<k<<"\n";
                return 0;
            }
            k=1;
        }
    }
    return 0;
}