#include <fstream>
using namespace std;

#define Nmax 1000011
int A[Nmax],N;

void read()
{
	scanf("%d",&N);
	for (int i=1;i<=N;++i)
		scanf("%d",&A[i]);
}

void solve()
{
	int k=1,cand=A[N];
	for (int i=1;i<N;++i)
	{
		k=( A[i]==cand )? k+1 : k-1;
		if ( k==-1 ) k=1,cand=A[i];
	}
	
	if ( k<=0 )
	{	printf("-1\n"); return; }
	
	k=( A[N]==cand )?1:0;
	for (int i=1;i<N;++i)
		k=( A[i]==cand )?k+1:k;
	
	if ( k< N/2+1 )
	{	printf("-1\n"); return; }
	
	printf("%d %d\n",cand,k);
}

int main()
{
	freopen("elmaj.in","r",stdin);
	freopen("elmaj.out","w",stdout);
	read();
	solve();
	return 0;
}