#include <iostream>
#include <sstream>
#include <math.h>
#include <stack>
#include <set>
#include <algorithm>
#include <string>
#include <queue>
#include <stack>
#include <map>
#include <cstdio>
#include <vector>
using namespace std;

#define INF (1 << 30)
#define INFLL (1LL << 60)

int main() {
	int kame = 0,turu = 0,a[51];
	int n;
	int ma = 0;
	cin >> n;
	for(int i = 0;i < n;i++){
		cin >> a[i];
		ma = max(a[i],ma);
	}
	for(int i = 0;i < n;i++){
		if(a[i] == ma) turu++;
		else kame++;
	}
	if(turu == n){
		if(a[0] / 4 == n-1) {
			kame = n;
			turu = 0;
		}else{
			kame = 0;
			turu = n;
		}
	}
	cout << turu << " " << kame << endl;
	return 0;
}