#include<cstdio>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
int i,n,cont,el,a[1000009];
int main()
{
freopen("elmaj.in","r",stdin);
freopen("elmaj.out","w",stdout);
scanf("%d",&n);
cont=0;
for(i=1;i<=n;i++)
{
    scanf("%d",&a[i]);
    if(cont==0) el=a[i];
    if(a[i]==el) cont++;
    else cont--;
}
cont=0;
for(i=1;i<=n;i++)
    if(a[i]==el) cont++;
if(cont>(n>>1)) printf("%d %d\n",el,cont);
else printf("-1\n");
return 0;
}