#include <iostream>
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
//complexitate O(n)
int main()
{
    int n, a[100001], nr = 0, cand = -1, i;
    f >> n;
    for(i = 1; i <= n; i++)
        f >> a[i];
    //
    //cautam eventualul candidat majoritar
    for(i = 1; i <= n; i++)
        if(nr == 0)
        {
            cand = a[i];
            nr = 1;
        }
        else
            if(cand == a[i])
                nr++;
            else
                nr--;
    //verificam daca posibilul candidat cand este majoritar
    //
    if(nr > 0)
    {
        nr = 0;
        for(i = 1; i <= n; i++)
            if(cand == a[i])
                nr++;
    }
    if(nr > n / 2)
        g  << cand << ' ' << nr;
    else
        g << -1;
    return 0;
}