#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
FILE *f,*g;
int v[1000002];
int n,x,nr;
void read()
{
    fscanf(f,"%d",&n);
    for(int i=1; i<=n; i++)
        fscanf(f,"%d ",&v[i]);

}
void solve()
{
    sort(v+1,v+n+1);
    x=v[n/2];
    for(int i=n/2; x==v[i]; i++,nr++){}
    for(int i=n/2-1; x==v[i];i--,nr++){}
}
void write()
{
    if(nr>=n/2+1)
        fprintf(g,"%d %d",x,nr);
    else
        fprintf(g,"-1");
}
int main()
{
    f=fopen("elmaj.in","r");
    g=fopen("elmaj.out","w");
    read();
    solve();
    write();
    fclose(f);
    fclose(g);
    return 0;
}