#include <fstream>
#include <algorithm>

using namespace std;

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

int v[1000000],n,nr,k,maxi,km=-1;

int main()
{
    cin>>n;
    for(int i=0;i<n;++i)
        cin>>v[i];
    sort(v,v+n);
    k=v[0];
    for(int i=0;i<n;++i)
    {
        if(v[i]==k)
            ++nr;
        else
        {
            if(nr>maxi)
            {
                km=k;
                maxi=nr;
            }
            nr=1;
            k=v[i];
        }
    }
    if(km==-1)
        cout<<"-1";
    else
        cout<<km<<" "<<maxi;
    return 0;
}