#include <iostream>
#include <fstream>
#include <unordered_map>

const static int NMAX = 1000001;

using namespace std;

ifstream input("elmaj.in");
ofstream output("elmaj.out");
int N;
unordered_map<int,int> hashMap;

int main()
{
    input >> N;
    int elementulMajoritar = 0;
    int aparitiiMaxim = -1;
    int nr;
    for (int i = 0; i < N ; i++)
    {
        input >> nr;
        hashMap[nr]++;
        if (aparitiiMaxim < hashMap[nr])
        {
            aparitiiMaxim = hashMap[nr];
            elementulMajoritar = nr;
        }
    }
    if (aparitiiMaxim >= N / 2 + 1)
        output << elementulMajoritar << " " << aparitiiMaxim;
    else output << -1;
    return 0;
}