#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int main()
{
int n,j,i,v[1000],aux,maxi=-1,k=0,poz;
f>>n;
for(i=1;i<=n;i++)
    f>>v[i];
sort(v+1,v+n+1);
 i=1;
 while(i<=n-1)
 {
     if(v[i]==v[i+1])
            {   j=i;
                k=0;
                while(v[j]==v[i]){k++;j++;}
                if(n/2+1<=k && maxi<k){maxi=k;
                                       poz=i;}
                i++;
            }
        else i++;
  }
 if(maxi==-1)g<<maxi;
    else g<<v[poz]<<" "<<maxi;
}