#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<unordered_map>

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>

using namespace std;

const int nmax = 1000005;

int n, i, cnt, cand, a[nmax];
int main()
{
    freopen("elmaj.in", "r", stdin);
    freopen("elmaj.out", "w", stdout);

    scanf("%d", &n);

    for(i = 1; i <= n; i++)
    {
        scanf("%d", &a[i]);
        if(cnt)
        {
            if(cand == a[i]) cnt++;
            else cnt--;
        }
        else
        {
            cand = a[i];
            cnt++;
        }
    }

    cnt = 0;
    for(i = 1; i <= n; i++)
        if(cand == a[i]) cnt++;

    if(cnt >= (n / 2 + 1))
    {
        printf("%d %d\n", cand, cnt);
        return 0;
    }

    printf("-1\n");

    return 0;
}