#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <climits>
using namespace std;

int n, k;
int v[1000001];


ifstream fin("elmaj.in");
ofstream fout("elmaj.out");

int main()
{
    fin >> n;
    int eMaj = 0, ap = 0;
    for (int i = 1; i <= n; i++)
    {
        
        fin >> v[i];
        if (eMaj == v[i])
        {
            ap++;
        }
        else {
            ap--;
            if (ap <= 0)
            {
                eMaj = v[i];
                ap = 1;
            }
        }
    }
    ap = 0;
    for (int i = 1; i <= n; i++)
    {
        if (eMaj == v[i])
        {
            ap++;
        }
    }
    if (ap < n / 2 + 1)
    {
        fout << "-1";
        return 0;
    }
    fout << eMaj << " " << ap;
    return 0;
}