#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n,k,nr=-1,j;
long long v[1000005];
int main()
{
    fin>>n;
    for(int i=1;i<=n;i++)
        fin>>v[i];
    sort(v+1,v+n+1);
    for(int i=1;i<=n-n/2-1;i++)
    {
        if(v[i]==v[i+n/2])
        {
            nr=v[i];
            k=n/2+1;
            j=i+k;
            while(v[i]==v[j])
            {
                j++;
            }
            fout<<nr<<" ";
            fout<<j-i<<"\n";
            return 0;
        }
    }
    fout<<nr<<"\n";
    return 0;
}