#pragma GCC optimize("O3")
#include <algorithm>
#include <stdio.h>

int n;

int main()
{
    FILE *fin = fopen( "elmaj.in", "r" );
    fscanf( fin, "%d", &n );
    
    int *v = new int[ n ];
    for( int i = 0; i < n; i++ )
        fscanf( fin, "%d", &v[ i ] );
    fclose( fin );

    std::sort( v, v + n );
    int i = n / 2;
    int j = n / 2 + 1;
    int val = v[ n / 2 ];
    
    int no = 0;
    while( i >= 0 && v[ i ] == val )
        --i, no++;

    while( j < n && v[ j ] == val )
        ++j, no++;

    FILE *fout = fopen( "elmaj.out", "w" );
    if( no > n / 2 )
        fprintf( fout, "%d %d\n", val, no );
    else fprintf( fout, "-1\n" );
    fclose( fout );
    return 0;
}