#include <fstream>
#include <algorithm>

#define NMAX 1000002
using namespace std;

ifstream fin ("elmaj.in");
ofstream fout ("elmaj.out");

int n, v[NMAX];

int main()
{
    int i, j, contor;
    fin>>n;
    for(i = 1; i <= n; i++) fin>>v[i];
    sort(v + 1, v + n + 1);
    for(i = 1; i <= n / 2; i++)
        if(v[i + n / 2] == v[i]) //dupa ce sunt sortate, el egale sunt pe poz consec
        {
          //am gasit majoritarul, ii numar aparitiile
          fout<<v[i]<<' ';
          for(j = i, contor = 0; j <= n && v[i] == v[j]; j++)
             contor++;
          fout<<contor<<'\n';
          return 0;
        }
    return 0;
}