#include <cstdio>
#include <algorithm>
#include <cstdlib>

using namespace std;

#define file_in "elmaj.in"
#define file_out "elmaj.out"

#define nmax 1010000

int N,V[nmax];
int i,j,nr;

int main(){
	
	freopen(file_in,"r",stdin);
	freopen(file_out,"w",stdout);
	
	scanf("%d", &N);
	for (i=1;i<=N;++i)
		 scanf("%d", &V[i]);
	
	sort(V+1,V+N+1);
	
	nr=0;
	i=1;
	while(i<=N){
		nr=1;
		j=i+1;
		while(V[i]==V[j]){ nr++; j++; }
		if (nr>=N/2+1){
			printf("%d %d\n", V[i], nr);
			exit(0);
		}
		i=j;
	}
	
	printf("-1\n");
	
	return 0;
	
}