#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
int v[1000001],i,acuma=1,n;
int main()
{
    FILE *f;
    FILE *g;
    f = fopen("elmaj.in", "r");
    g = fopen("elmaj.out", "w");
    fscanf(f,"%d", &n);
    for(i=1;i<=n;i++)
    {
        fscanf(f, "%d", &v[i]);
    }
    sort(v+1,v+n+1);
    for(i=2;i<=n;i++)
    {
        if(v[i]==v[i-1])
            acuma++;
        else
        {
            if(acuma >= n/2+1)
            {
                fprintf(g, "%d %d", v[i-1],acuma);
                acuma = 1;
                return 0;
            }
            else
                acuma =1;
        }
    }
     if(acuma >= n/2+1)
            {
                fprintf(g, "%d %d", v[n],acuma);
                acuma = 1;
                return 0;
            }
    fprintf(g, "-1");
    return 0;
}