#include <fstream>
#include <algorithm>
#include <vector>
#include <cstring>
#include <deque>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <climits>
#include <queue>

#define MOD 666013

using namespace std;

ifstream cin("elmaj.in") ;
ofstream cout("elmaj.out") ;

int v[1000009] ;

int main()
{

    int n ;

    cin >> n ;

    int prev, curent = 0 ;

    for(int f = 1, a ; f <= n ; f ++)
    {

        cin >> a ;

        if(a == prev)curent ++ ;
            else if(!curent)curent = 1, prev = a ;
                else curent -- ;

        v[f] = a ;

    }

    int cnt = 0 ;

    for(int f = 1 ; f <= n ; f ++)
        if(v[f] == prev)cnt ++ ;

    if(cnt <= n/2)
    {

        cout << -1 ;

        return 0 ;

    }

    cout << prev << " " << cnt ;

    return 0 ;
}