#include <bits/stdc++.h>

using namespace std;

void compute_sol(int n, vector < int > arr) {
    int X = arr[1]; int cnt = 1;
    for (int i = 2; i <= n; ++i) {
        if (arr[i] == X) cnt++; else cnt--;
        if (cnt == 0) X = arr[i], cnt = 1;
    }

    int all = 0;
    for (int i = 1; i <= n; ++i)
        all += (arr[i] == X);

    if (2 * all < n) printf("-1\n");
    else printf("%d %d\n", X, all);
}

int main() {
    freopen("elmaj.in","r",stdin);
    freopen("elmaj.out","w",stdout);

    int n; scanf("%d", &n);

    vector < int > arr(n + 1, 0);
    for (int i = 1; i <= n; ++i)
        scanf("%d", &arr[i]);

    compute_sol(n, arr);
    return 0;
}