#include <iostream>
#include <fstream>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int n,v[1000000],c;
struct nod
{
    int info;
    nod *next;
}*prim;
void push(int k)
{
    nod *p=new nod;
    p->info=k;
    p->next=prim;
    prim = p;
}
int pop()
{
    if(prim != NULL)
    {
        int k=prim->info;
        prim=prim->next;
        return k;
    }
    return -1;
}
int peek()
{
    if(prim != NULL)
        return prim->info;
    return -1;
}
int main()
{
    in >> n;
    for(int i=0;i<n;i++)
        in >> v[i];
    for(int i=0;i<n;i++)
    {
        if(peek()==-1)
            push(v[i]);
        else
        {
            if(peek()!=v[i])
                pop();
            else
                push(v[i]);
        }
    }
    for(int i=0;i<n;i++)
        if(v[i]==prim->info)
            c++;
    if(c>n/2)
        out << prim->info << " " << c;
    else out << -1;
    return 0;
}