#include <cstdio>
#include <algorithm>
using namespace std;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n):i({0}),n({n}){}range(int i,int n):i({i}),n({n}){}I& begin(){return i;}I& end(){return n;}};

int main(void) {
  int n; scanf("%d", &n);
  vector<int> a(2*n);
  for(int i : range(2*n)) { scanf("%d", &a[i]); }
  sort(a.begin(), a.end());
  int dry = 0, wet = 0, moist = 0;
  for(int i=0, j=2*n-1; i<j; j--) {
    if(a[i] + a[j] < 0) { dry++; i++; }
  }
  for(int i=0, j=2*n-1; i<j; i++) {
    if(a[i] + a[j] > 0) { wet++; j--; }
  }
  for(int i=0, j=2*n-1; i<j; ) {
    int check = a[i] + a[j];
    moist += check == 0;
    i += check <= 0;
    j -= check >= 0;
  }
  printf("%d %d %d\n", dry, wet, moist);
  return 0;
}