// yukicoder: No.112 ややこしい鶴亀算
// 2019.4.10 bal4u

#include <stdio.h>

int a[52], N;

int main()
{
	int i, s, t, k, min, max;

	scanf("%d", &N);
	scanf("%d", a);
	min = max = a[0];
	for (i = 1; i < N; i++) {
		scanf("%d", a + i);
		if (a[i] < min) min = a[i];
		if (a[i] > max) max = a[i];
	}
	if (min == max) {
		k = max / (N - 1);
		if (k == 2) s = N, t = 0;
		else s = 0, t = N;
	}
	else {
		s = t = 0;
		for (i = 0; i < N; i++) {
			if (a[i] == max) s++;
			else t++;
		}
	}
	printf("%d %d\n", s, t);
	return 0;
}