#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int v[1000005],x,n,l,i,o,el;
int main()
{
    f>>n;
    for (i=1;i<=n;i++)
    f>>v[i];
    x=n/2+1;
    sort(v+1,v+n+1);
    for (i=1;i<=n;i++)
    {
      if (v[i]!=v[i-1])
      {
          if (l>=x) o=l,el=v[i-1];
          l=1;
      }
      else l++;
    }
    g<<el<<' '<<o;
    return 0;
}