#include <stdio.h>
#include <map>

using namespace std;

int main(){
	freopen("elmaj.in","r",stdin);
	freopen("elmaj.out","w",stdout);

	int N, x, i;
	map<int,int> occurances;
	bool flag = false;
	int candidate;

	scanf("%d ", &N);

	for (i=0; i<N; i++){
		scanf("%d ", &x);
		if(occurances.find(x) == occurances.end())
			occurances[x] = 1;
		else{
			occurances[x] ++;
			if(occurances[x] >= N/2 +1){
				candidate = x;				
				flag = true;
			}
		}
	}

	if(flag == false)
		printf("-1");
	else
		printf("%d %d", candidate, occurances[candidate]);
	return 0;
}