/*#include <iostream>
#include <fstream>

using namespace std;
int v[100001],n;

int cautare(int x)
{
    int cnt=0;
    for(int i=1;i<=n;i++) if(v[i]==x) cnt++;
    if(cnt>n/2+1) return cnt;
    else return -1;
}
int main()
{
    ifstream cin("elmaj.in");
    ofstream cout("elmaj.out");

    int max=-1,val;
    cin>>n;

   for(int i=1;i<=n;i++) cin>>v[i];
    for(int i=1;i<=n;i++)
    {
        int ans=cautare(v[i]);
        if(ans!=-1 && ans>max)
        {
            max=ans;
            val=v[i];
        }
    }

    cout<<val<<" "<<max;

    return 0;
}*/

/*#include <fstream>
#include <algorithm>
using namespace std;

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

int n, v[1000001],mx=0,m;

int main()
{
    f>>n;
    for(int i=1;i<=n;i++)f>>v[i];
    sort(v+1,v+n+1);
    int nr=1;
    for(int i=2;i<=n;i++)
    {
        if(v[i]==v[i-1]){nr++;}
        else
        {
            if(nr>mx){mx=nr;
            m=v[i-1];}
            nr=1;
        }
    }
    if(nr>mx){mx=nr;m=v[n];}
    if(mx>=n/2+1)
    g<<m<<" "<<mx;
    else g<<-1;
    return 0;
}
*/
#include <iostream>
#include <fstream>

using namespace std;
long long v[1000001];
int main()
{
    ifstream cin("elmaj.in");
    ofstream cout("elmaj.out");

    int n,nr;
    cin>>n;

    for(int i=1;i<=n;i++)
    {
        cin>>nr;
        v[nr]++;
    }
    int max=0,val,e=n/2+1;

    for(int i=1;i<=n;i++)
    {
        if(v[i]>=e && v[i]>max )
        {
            max=v[i];
            val=i;
        }
    }

    if(max>0) cout<<val<<" "<<max;
    else cout<<"-1";

    return 0;
}