#include <stdio.h>
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <string.h>
#include <set>

#define N 1000001

#define max(a,b) ((a) >= (b) ? (a) : (b))

using namespace std;

int compare (const void * a, const void * b)
{	
  return ( *(int*)a - *(int*)b );
}


int v[N];

int main () {


	FILE *f, *g;
	f = freopen("elmaj.in", "r", stdin);
	g = freopen("elmaj.out", "w", stdout);

	
	int i, j, k, n;
	char c;
	

	scanf("%d", &n);
	
	for (i = 0; i<n; i++) {
		scanf("%d", &v[i]);
	}

	qsort (v, n, sizeof(v[0]), compare);
	
	k = 1;
	
	for (i = 1; i<n; i++) {
		if (v[i] == v[i-1]) {
			k++;
			
		}
		else {
			if (k > n/2)
				break;
			k = 1;
			}		
	}
	
	
	if (k > n/2)
		printf("%d %d\n", v[i-1], k);
	else
		printf("-1\n");
		
	
	return 0;
	
}