#include <stdio.h>
#include <unordered_map>
using namespace std;

int n, x;
unordered_map<int, int> fr;

int main()
{
    freopen("elmaj.in","r",stdin);
    freopen("elmaj.out","w",stdout);
    scanf("%d",&n);
    for (int i=1;i<=n;i++){
        scanf("%d",&x);
        if (fr.find(x) == fr.end()) {
             fr[x]=1;
         } else {
             fr[x]++;
             if (fr[x]>n/2){
                printf("%d %d\n", x, fr[x]);
                return 0;
             }
         }
    }
    printf("-1\n");
    return 0;
}