#include<iostream>
#include<list>
#include<algorithm>
using namespace std;
list<int> a;
int b[1000002],n,maxv,maxc=-1,size;
int main(){
	freopen("elmaj.in", "r", stdin);
	freopen("elmaj.out", "w", stdout);
	int e,x;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
    	scanf("%d",&x);
    	e=find(a.begin(),a.end(),x) - a.begin();
    	if(e==size){
			size++;
    		a.push_back(x);
			if(maxc<0){maxc=1,maxv=x;}
    	}else{
			b[e]++;
			if(b[e]>maxc){
				maxc=b[e],maxv=x;
			}
		}
    }
	if(maxc>=n/2)
		printf("%d %d",maxv,maxc+1);
	else printf("-1");
}