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

using namespace std;

int v[1000001];
int main()
{
    ifstream fin ("elmaj.in");
    ofstream fout ("elmaj.out");

    int n, i, j;
    fin>>n;

    for(i=1; i<=n; i++)
    {
        fin>>v[i];
    }

    sort(v+1, v+n+1);

    i=1;
    while(i<=n)
    {
        cout<<"i= "<<i<<"\n";

        j=i;

        while(v[j+1] == v[i] && j+1<=n)
        {
            j++;
        }

        if(j-i+1 >= n/2+1)
        {
            fout<<v[i]<<' '<<j-i+1<<"\n";
        }

        i=j+1;
    }

}