#include<iostream>
#include<fstream>
#include<sstream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<vector>
#include<list>
#include<algorithm>
#include<utility>
#include<complex>

using namespace std;

int N;
int A[200000];

int main(void){
	cin >> N;
	N <<= 1;
	for (int i = 0; i < N; i++)
		cin >> A[i];
	sort(A, A + N);
	int left = 0,right=N-1;
	int cnt;

	//Dry
	cnt = 0; left = 0; right = N - 1;
	while (left<right){
		while (left < right&&A[left] + A[right] >= 0)right--;
		if (left == right)break;
		else{
			cnt++;
			left++;
			right--;
		}
	}
	cout << cnt << " ";

	//Wet
	cnt = 0; left = 0; right = N - 1;
	while (left<right){
		while (left < right&&A[left] + A[right] <= 0)left++;
		if (left == right)break;
		else{
			cnt++;
			left++;
			right--;
		}
	}
	cout << cnt << " ";

	//Moist
	cnt = 0; left = 0; right = N - 1;
	while (left < right&&A[left] <= 0 && A[right] >= 0){
		if (-A[left] > A[right])
			left++;
		else
			if (-A[left] < A[right])
				right--;
			else
				cnt++, left++, right--;

	}
	cout << cnt << endl;

	return(0);
}