#include <fstream>
#include <unordered_map>
#include <vector>
using namespace std;

ifstream is ("elmaj.in");
ofstream os ("elmaj.out");

int n, x;
unordered_map <int,int> ap;
vector <int> v;

void Solve();

int main()
{
    Solve();
    is.close();
    os.close();
    return 0;
}

void Solve()
{
    is >> n;
    for (int i = 0; i < n; ++i)
    {
        is >> x;
        v.push_back(x);
        ap[v[i]]++;
    }
    for (int i = 0; i < n; ++i)
        if (ap[v[i]] >= (n/2)+1)
        {
            os << v[i] << ' ' << ap[v[i]];
            return;
        }
    os << -1;
};