#include<stdio.h>
#include<algorithm>
FILE *in,*out;
int n,v[100001],ma,mijloc,i,j,a;
int main()
{
    in=fopen("elmaj.in","rt");
    out=fopen("elmaj.out","wt");

    fscanf(in,"%d",&n);
    for(i=1;i<=n;i++)
    fscanf(in,"%d",&v[i]);

    mijloc=(n+1)/2;

    std::sort(v+1;v+n+1)
    i=mijloc;
    n=v[mijloc];
    while(v[i++]==n)
        a++;
    i=mijloc;
    while(v[i--]==n)
        a++;

    if(a-1>mijloc)
    fprintf(out,"%d %d",v[mijloc],a-1);


    fclose(in);
    fclose(out);
    return 0;
}