#include <iostream>
#include <fstream>
#include <cstring>
#include <string>
#include <climits>
#include <algorithm>
#include <cmath>
#include <queue>
#include <deque>
#include <iomanip>
#include <stack>
#include <cstdio>

using namespace std;

ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
#define baza 10

#define MAX 1000010
typedef long long int lli;


int a[MAX];

int main()
{
    int n, i, count, nr;
        fin>>n;
        for(i=1;i<=n;i++)
        {
            fin>>a[i];
        }
        sort(a+1, a+n+1);
        count=1, nr=a[1];
        for(i=1;i<n;i++)
        {
            if(a[i]==a[i+1])
                count++;
            else
            {
                if(count>=n/2+1)
                {
                    fout<<nr<<" "<<count;
                    goto g;
                }
                count=1;
                nr=a[i+1];
            }
        }
        fout<<"-1";
        g:




    return 0;
}