#include <map>
#include <algorithm>
#define REP(i,n) for(int i=0; i<(int)(n); i++)

#include <queue>
#include <cstdio>
inline int getInt(){ int s; scanf("%d", &s); return s; }

#include <set>

using namespace std;

int solvePlus(vector<int> &p, vector<int> &m, vector<int> &z){
  int cnt = 0;

  int pp = 0;
  int mp = 0;

  while(pp < (int)p.size() && mp < (int)m.size()){
    while(pp < (int)p.size() && p[pp] <= m[mp]) pp++;
    if(pp != (int)p.size()) cnt++;
    mp++; pp++;
  }

  int rest = p.size() - cnt;
  int zc = min(rest, (int)z.size());
  rest -= zc;

  return cnt + zc + rest / 2;
}

int solveMinus(vector<int> &p, vector<int> &m, vector<int> &z){
  return solvePlus(m, p, z);
}

int solveZero(vector<int> &p, vector<int> &m, vector<int> &z){
  map<int, int> mc;
  REP(i,m.size()) mc[m[i]]++;

  int ret = z.size() / 2;
  REP(i,p.size()){
    if(mc[p[i]] > 0){
      ret++;
      mc[p[i]]--;
    }
  }

  return ret;
}

int main(){
  const int n = getInt();
  vector<int> p;
  vector<int> m;
  vector<int> z;

  REP(i,2*n){
    const int a = getInt();
    if(a == 0) z.push_back(a);
    else if(a > 0) p.push_back(a);
    else m.push_back(-a);
  }

  sort(p.begin(), p.end());
  sort(m.begin(), m.end());

  const int dry = solveMinus(p, m, z);
  const int wet = solvePlus(p, m, z);
  const int moist = solveZero(p, m, z);

  printf("%d %d %d\n", dry, wet, moist);

  return 0;
}