#include <fstream>
#include<algorithm>
using namespace std;

//long long n, a[1000000], frecventa[1000000], i;
unsigned long long n, a[1000001],frecventa[1000001],  majoritar, i;
ifstream f("elmaj.in");
ofstream g("elmaj.out");

bool cmp(int a, int b)
{
//return i<j;       

if(a<b)
return 1;
return 0;
}

int main()
{
   
    f>>n;
    for(i=1;i<=n;i++)
    {f>>a[i];
      frecventa[a[i]]++;
    }
    sort(a+1, a+1+n,cmp);
    
    if(frecventa[(n-1)/2]>=(n-1)/2)
      g<<a[(n-1)/2]<<" "<<frecventa[(n-1)/2];   
    else 
    g<<-1;
    
    return 0;
    
}