#include <iostream>
#include<algorithm>
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int main()
{
    int a[10],i,n,count=0;int majorityElement;
    f >> n;
    for(int i = 0; i < n; i++)f >> a[i];
    for (i = 0 ; i < n ; i++)
    {
        if (count == 0) {
            majorityElement = a[i];
            count = 1;
        }
        else
        {
            if(a[i] == majorityElement)
                count++;
            else
                count--;
        }
    }
    count = 0;
    for (i = 0; i < n; i++) {
        if (a[i] == majorityElement) {
            count++;
    }
    }
    if (count > (n/2)) {
        g<< majorityElement<<" "<<count;
    }
    else g<<"-1" ;
return 0;
}