#include<stdio.h>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <string>
#include <stdio.h>

using namespace std;

int main() {

	int N, turu = 0, kame = 0, a[50];
	cin >> N;
	int big=0, sml=50*4;
	for (int i = 0; i < N; i++) {
		int t;
		cin >> t;
		if (big < t) big = t;
		else if (t < sml) sml = t;
		
		if (sml > big) swap(sml , big);

		a[i] = t;
	}

	for (int i = 0; i < N; i++) {
		if (a[i] == big) turu++;
		else kame++;
	}

	cout<<kame <<  " " << turu << endl;
	return 0;
}