#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;
long long v[1000001];

int main()
{
    ifstream fin("elmaj.in");
    ofstream fout("elmaj.out");
    int n, nrAparitii = 0;
    fin >> n;

    for (int i = 1; i <= n; ++i) {
        fin >> v[i];
    }
    sort(v + 1, v + n + 1);
    for (int i = 1; i <= n; ++i) {
        if (v[i] == v[i + n/2]) {
            nrAparitii = n/2;
            for (int j = i + n/2; j < n; ++j) {
                if (v[j] == v[j + 1]) {
                    nrAparitii += 1;
                } else {
                    nrAparitii += 1;
                    break;
                }
            }
            fout << v[i] << " " << nrAparitii;
            break;
        }
    }

    return 0;
}