#include <algorithm>
#include <cstdio>

using namespace std;

long long a[10000005];


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