#include <iostream>
#include <fstream>

using namespace std;
int v[100001],n;

int cautare(int x)
{
    int cnt=0;
    for(int i=1;i<=n;i++) if(v[i]==x) cnt++;
    if(cnt>n/2+1) return cnt;
    else return -1;
}
int main()
{
    ifstream cin("elmaj.in");
    ofstream cout("elmaj.out");

    int max=-1,val;
    cin>>n;

   for(int i=1;i<=n;i++) cin>>v[i];
    for(int i=1;i<=n;i++)
    {
        int ans=cautare(v[i]);
        if(ans!=-1 && ans>max)
        {
            max=ans;
            val=v[i];
        }
    }

    cout<<val<<" "<<max;

    return 0;
}