#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>

using namespace std;


int main(){
	int N;
	cin >> N;
	vector<int> a(N);
	int sum = 0;
	for(int i=0; i<N; i++){
		cin >> a[i];
		sum += a[i];
	}
	sort(a.begin(), a.end());
	int kame = upper_bound(a.begin(), a.end(), a[0]) - a.begin();
	int tsuru = N-kame;
	if(kame==N){	//鶴と亀どちらか一方しかいない
		if(sum/N/(kame-1) == 4){
			
		}else{
			tsuru = kame;
			kame = 0;
		}
	}
	cout << tsuru << " " << kame << endl;
	return 0;
}