#include <bits/stdc++.h>
using namespace std;

int a[1000005],n;
int main()
{
     ifstream in("elmaj.in");
     ofstream out("elmaj.out");
     in >> n;
     for (int i=1; i<=n; i++) in >> a[i];

     sort( a+1, a+n+1);

     int check = 0, ans = 0, el;
     for( int i=1; i <=n; i++)
     {
          if( a[i] == a[i+1] ) check ++;
          else if( check +1 > ans ) el = a[i], ans = check + 1,check = 0;
     }
     if( ans >= n /2 + 1) out << el << ' ' << ans ; else out << -1;


    return 0;
}