#include <fstream>
#include <algorithm>

using namespace std;

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

int v[500002];

int main()
{
    int n, i;

    fin >> n;

    for(i = 0; i < n; i++)
        fin >> v[i];

    sort(v, v + n);

    int k = v[0], l = 0;
    v[n] = 0;

    for(i = 0; i <= n; i++) {
        if(v[i] == k)
            l++;
        else
        {
            if(l > n / 2)
            {
                fout << k << " "<<l;
                break;
            }
            l = 1;
            k = v[i];
        }
    }
    if(i == n + 1)
        fout << -1;

    return 0;
}