#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
#include <numeric>
using namespace std;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1<<25;
typedef pair<int,int> P;
typedef long long ll;
typedef unsigned long long ull;

map<int, int> dc;

int main(){
	int n;
	cin>>n;
	n *= 2;
	vector<int> d(n);
	for(int i = 0; i < n; i++) cin>>d[i];
	sort(d.begin(), d.end());
	// for(int i = 0; i < n; i++) ++dc[d[i]];
	ll res[3] = {};
	int pos = n-1;
	// while(pos>=0 && d[0]+d[pos]>=0) pos++;
	for(int i = 0; i < n; i++){
		while(pos>i && d[i]+d[pos]>=0) pos--;
		if(pos<=i){
			res[0] = i;
			break;
		}
		pos--;
	}
	pos = 0;
	for(int i = n-1; i >= 0; i--){
		while(pos<i && d[i]+d[pos]<=0) pos++;
		if(pos>=i){
			res[1] = n-i-1;
			break;
		}
		pos++;
	}
	pos = n-1;
	for(int i = 0; i < n; i++){
		while(pos>i&& d[i]+d[pos]>0) pos--;
		if(pos<=i) break;
		if(d[i]+d[pos]==0){
			res[2]++;
			pos--;
		}
	}
	printf("%d %d %d\n", res[0], res[1], res[2]);
	return 0;
}