// yukicoder: 190 Dry Wet Moist
// 2019.5.20 bal4u

#include <stdio.h>
#include <stdlib.h>

#if 1
#define gc() getchar_unlocked()
#else
#define gc() getchar()
#endif
int in()   // 整数の入力（負数対応）
{
	int n = 0, c = gc();
	if (c == '-') {	c = gc();
		do n = 10*n + (c & 0xf), c = gc(); while (c >= '0');
		return -n;
	}
	do n = 10*n + (c & 0xf), c = gc(); while (c >= '0');
	return n;
}

int a[200005];
int cmp(const void *a, const void *b) { return *(int *)a - *(int *)b; }

int main()
{
	int i, j, N, n, ans;
	
	N = in(), n  = N << 1;
	for (i = 0; i < n; i++) a[i] = in();
	qsort(a, n, sizeof(int), cmp);
	ans = 0, i = 0, j = n-1;
	if (a[i] < 0) {
		while (i < j) {
			if (-a[i] > a[j]) ans++, i++, j--;
			while (-a[i] == a[j]) j--;
			while (-a[i] < a[j]) j--;
			if (a[i] >= 0) break;
		}
	}
	printf("%d", ans);
	
	ans = 0, i = 0, j = n-1;
	if (a[j] > 0) {
		while (i < j) {
			if (-a[i] < a[j]) ans++, i++, j--;
			while (i < j && -a[i] == a[j]) i++;
			while (i < j && -a[i] > a[j]) i++;
			if (a[j] <= 0) break;
		}
	}
	printf(" %d", ans);
	
	ans = 0, i = 0, j = n-1;
	if (a[i] <= 0 && a[j] >= 0) {
		while (i < j) {
			if (-a[i] == a[j]) ans++, i++, j--;
			while (i < j && -a[i] < a[j]) j--;
			while (i < j && -a[i] > a[j]) i++;
		}
	}
	printf(" %d\n", ans);
	return 0;
}