#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

using namespace std;
typedef long long ll;
typedef pair<int, int> Pr;

int N;
int A[1010];

int main()
{
	int turu=0, kame=0,num =0,a;
	cin >> N;

	num = N * 2;
	for (int i = 0; i < N; i++) {
	    cin >> a;
		A[a]++;
	}
	bool flag = false;
	for (int i = 0; i <= 1000; i++) {
		if (!flag && A[i] != 0) {
			kame = A[i];
			flag = true;
		}
		else if(flag && A[i] != 0){
			turu = A[i];
		}
	}

	if (kame == N) {
		if (a < num) {
			turu = kame;
			kame = 0;
		}
	}
	cout << turu << " " << kame << endl;
	return 0;
}