#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>

using namespace std;

#ifdef LOCAL
ifstream fin("input.txt");
#define fout cout
#else
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
#endif

#define endl '\n'

const int NMAX = 1e6+5;

int n;
int a[NMAX];

void read() {
  fin >> n;
  for (int i = 1; i <= n; i++) {
    fin >> a[i];
  }
}

void solve() {
  sort(a + 1, a + n + 1);

  int len = 1;
  for (int i = 1; i < n; i++) {
    if (a[i] != a[i + 1]) {
      if (len > (n >> 1)) {
        fout << a[i] << ' ' << len;
        return;
      }
      len = 1;
    } else {
      len++;
    }
  }

  fout << -1;
}

int main() {
  read();
  solve();
  return 0;
}