#include <bits/stdc++.h>

using namespace std;

const int nmax = static_cast<int> (1e9 + 1);
int n, v;

int main() {
    freopen("carici.in", "r", stdin);

    freopen("algsort.in", "r", stdin);
    freopen("algsort.out", "w", stdout);

    scanf("%d", &n);

    int candidate = -1;
    int k = 0;

    for (int i = 1; i <= n; i++) {
        scanf("%d", &v);
        if (k == 0) {
            candidate = v;
            k = 1;
        } else if (v == candidate) {
            k++;
        } else {
            k--;
        }
    }
    fseek(stdin, 0, SEEK_SET);
    scanf("%d", &n);

    if (candidate < 0) {
        cout << "-1\n";
    } else {
        k = 0;
        for (int i = 1; i <= n; i++) {
            scanf("%d", &v);
            if (v == candidate) {
                k++;
            }
        }

        if (k > n / 2) {
            cout << candidate << " " << k << "\n";
        } else {
            cout << "-1\n";
        }
    }

    return 0;
}