#include <fstream>
#include<algorithm>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,v[1000005];
int main()
{   f>>n;
    for(int i=1;i<=n;i++) f>>v[i];
    sort(v+1,v+n+1);
    int frmax=0,frc=1,elmax;
    for(int i=2;i<=n;i++)
        if(v[i-1]==v[i]) frc++;
        else
        {   if(frmax<frc) {frmax=frc; elmax=v[i-1];}
            frc=1;
        }
    if(frmax<frc) {frmax=frc; elmax=v[n];}
    if(frmax>n/2) g<<elmax<<" "<<frmax; else g<<-1;
    return 0;
}