#include <cstdio>
#include <algorithm>
using namespace std; 
int v[1000005]; 
int main() 
{    
	int i,n,y=1;   
	freopen("elmaj.in","r",stdin);   
	freopen("elmaj.out","w",stdout);  
	scanf("%d",&n);    
	for (i=1;i<=n;++i)    
		scanf("%d",&v[i]);  
	sort(v+1,v+n+1);  
	int m=n/2+1;
	for (i=1;i<=n;++i)  
	{             
		if (v[i]==v[i+1])        
			++y;    
		else		
			if (y>=m)         
			{             
				printf("%d %d\n",v[i],y);           
				return 0;
			}    
			else
				y=1;
	}     
	if (y)
		printf("-1\n");     
	return 0; 
}