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

using namespace std;

#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "elmaj";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif

const int NMAX = 1000000 + 5;

int N;
int A[NMAX];

int main() {
    int i, last, cnt;

#ifndef ONLINE_JUDGE
    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);
#endif

    scanf("%d", &N);

    last = cnt = 0;

    for(i = 1; i <= N; i++) {
        scanf("%d", &A[i]);

        if(last == A[i])
            cnt++;
        else {
            cnt--;
            if(cnt < 0) {
                cnt = 1;
                last = A[i];
            }
        }
    }

    cnt = 0;

    for(i = 1; i <= N; i++)
        if(last == A[i])
            cnt++;

    if(cnt >= N / 2 + 1)
        printf("%d %d\n", last, cnt);
    else
        printf("-1\n");

    return 0;
}