#include <iostream>
#include <stdio.h>
#include <math.h>
#include <stack>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <string.h>

using namespace std;

void sol();

int main() {
#ifdef PADREATI
    freopen("in.txt", "r", stdin);
#else
    freopen("elmaj.in", "r", stdin);
    freopen("elmaj.out", "w", stdout);
#endif
    sol();
    return 0;
}

#define ull unsigned long long int

#define N 1000000
#define D 31

int n;
ull v[N];
//int h[D];

void sol() {
    scanf("%d", &n);
    int k = 0;
    ull candidate = 0;
    for (int i = 0; i < n; i++) {
        scanf("%llu", &v[i]);
        if (!k) {
            candidate = v[i];
            k++;
            continue;
        }
        if(v[i]==candidate) {
            k++;
        } else {
            k--;
        }
    }

    int cnt = 0;
    for (int i = 0; i < n; i++) if (v[i] == candidate)cnt++;
    if (cnt <= n / 2) {
        printf("-1\n");
        return;
    }
    printf("%llu %d", candidate, cnt);

}