#include<stdio.h>
#include<algorithm>
using namespace std;
/*long v[1000000],n,shp,nr;
bool ver;*/
int poz[2000000],n,rasp1,rasp2,x;
int main(){
    int player_unu=0;

    freopen("elmaj.in","r",stdin);
    freopen("elmaj.out","w",stdout);
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    {
        scanf("%d",&x);
        poz[x]++;
        if(poz[x]>rasp1)
        {
            rasp1=poz[x];
            rasp2=x;
        }
    }
    if(rasp1>=n/2+1)
    printf("%d %d",rasp2,rasp1);
    else
    printf("-1");
   /* sort(v,v+n);
    for(int i=0;i<n;i++)
    {
        if(i==0)
        shp=v[i];
        else
        {
            if(v[i]==shp)
            nr++;
            else
            {
                if(nr>=n/2+1)
                {printf("%ld %ld",shp,nr);ver=1;break;}
                nr=0;
                shp=v[i];
            }
        }
    }
    if(ver==0)
    printf("-1");*/
    return player_unu;
}