#include <bits/stdc++.h>
using namespace std;

int main(void){
	int n;
	cin >> n;
	n *= 2;
	vector<int> a(n);
	for(int i=0;i<n;i++){
		cin >> a[i];
	}
	sort(a.begin(),a.end());

	int l = 0,r = a.size()-1;
	int wet = 0;
	while(l < r){
		if(a[r] + a[l] > 0){
			wet++;
			r--;
			l++;
		}else{
			l++;
		}
	}

	l = 0,r = a.size()-1;
	int dry = 0;
	while(l < r){
		if(a[r] + a[l] < 0){
			dry++;
			r--;
			l++;
		}else{
			r--;
		}
	}

	int moi = 0;
	vector<int> ar(200010);
	for(int i=0;i<n;i++){
		if(ar[-a[i]+100000] > 0){
			moi++;
			ar[-a[i]+100000]--;
		}
		else
			ar[a[i]+100000]++;
	}
	cout << dry << " " << wet << " " << moi << endl;

	return 0;
}