#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")

using namespace std;

int aparitii(vector<int>&v, int n, int x) {
    int cnt = 0;
    for (int i = 1; i <= n; i++) {
        if (v[i] == x) cnt++;
    }
    return cnt;
}

int main() {
    ifstream cin("elmaj.in");
    ofstream cout("elmaj.out");

    int n, cnt = 0, cand;
    cin >> n;
    vector<int> v(n + 1);

    for (int i = 1; i <= n; i++) {
        cin >> v[i];
    }
    for (int i = 1; i <= n; i++) {
        if (cnt == 0) {
            cand = v[i];
            cnt = 1;
        }
        else if (v[i] == cand)
            cnt++;
        else cnt--;
    }
    int apar = aparitii(v, n, cand);
    if (apar > n / 2) {
        cout << cand << " " << apar;
    }
    else cout << 0 << " " << 0;
    return 0;
}