#include <fstream>
#include <cstring>
#include <algorithm>

using namespace std;

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

int v[1000005], n, i, element, aparitii, j;
bool gasit;

int main()
{
f >> n;
 for (i=1; i<=n; i++)
     f >> v[i];
sort(v+1, v+n+1);
i = 1, gasit = true;
 while (i <= n && gasit)
 {
    if (v[i] == v[i+1])
    {
        j = i;
         while (v[j] == v[j+1] && j+1 <= n)
             j ++;
        if (j-i+1 >= n/2+1)
        {
            element = v[i];
            aparitii = j-i+1;
            gasit = false;
        }
      i = j;
    }
   i ++;
 }
if (gasit)
   g << -1;
else
   g << element << " " << aparitii;
    return 0;
}