#include <cstdio>
#include <algorithm>
using namespace std;
int v[1000001],s[1000001],n;

void concat(){
    int d=n/2+1,i=1;
    while(i<=n/2+1){
        if(v[i]>v[d])swap(v[i],v[d]);
        i++; }
}

int main(){
    int x,a;
    freopen("elmaj.in","r",stdin);
    freopen("elmaj.out","w",stdout);
        scanf("%d",&n);
        for(int i=1;i<=n;i++)scanf("%d",&s[i]);
    sort(s+1,s+n/2+1);
    sort(s+n/2+1,s+n+1);
    merge(s+1,s+n/2+1,s+n/2+1,s+n+1,v);
    x=v[1]; a=1;
    for(int i=2;i<=n;i++)
    if(v[i]!=v[i-1]){
        if(a>=(n/2)+1){
            printf("%d %d\n",x,a);
            return 0; }
        x=v[i]; a=1;} else a++;
    printf("-1\n");
}