#include <fstream>
#include <cstdio>
#include <algorithm>

using namespace std;


ofstream out("elmaj.out");

const int N=1000001;

int v[N],n,win,contor;

void afisare() {
	for( int i = 1; i <= n; ++i)
		out<<v[i] <<" ";
	out<<"\n";
}
int main(){
	int i;
	freopen("elmaj.in","r",stdin);
	
	scanf("%d", &n);
	for(i=1;i<=n;++i){
		scanf("%d", &v[i]);
	}
	// afisare();
	sort (v + 1, v + n + 1);
	// afisare();
	int count = 1, val = v[ 1];
	int max = 0, cine = 3;
	for( int i = 2; i <= n; ++i) {
		if( v[i] != v[ i - 1]) {
			count = 0;
			val = v[i];
		}
		count++;
		if( count > max) {
			max = count;
			cine = v[ i ];
		}
	}
	if( max > n/2) 
		out<<cine<<" "<<max;
	else out<<"-1";
		
	
}