#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;

int N;

int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cin >> N;
  map <int,int> memo;
  multiset <int> minus;
  multiset <int> plus;
  int zero = 0;
  rep(i,2*N){
    int x;
    cin >> x;
    if (x < 0) {
      minus.insert(-x);
      memo[x] += 1;
    }else if (x > 0){
      plus.insert(x);
      memo[x] += 1;       
    }else{
      zero += 1;
    }

  }
  //DEBUG1(memo);
  int ans_moist = 0;
  int ans_dry = 0;
  int ans_wet = 0;
  //Moist
  numa(x,memo){
    if (x.fir > 0) {
      break;
    }
    ans_moist += min(memo[-x.fir],x.sec);
  }
  ans_moist += zero / 2;

  {
    //dry
    multiset <int> p;
    numa(x,plus){
      p.insert(-x);
    }
    auto m = minus;
    int tmp_zero = zero;
    int g = 0;
    numa(x,m){
      auto it = p.lower_bound(-x+1);
      if (it != p.end()) {
        p.erase(it);
        ans_dry += 1;
      }else{
        if (tmp_zero > 0) {
          ans_dry += 1;
          tmp_zero -= 1;
        }else{
          g += 1;
        } 
      }
    }
    ans_dry += g / 2;
  }
  {
    //dry
    auto p = plus;

    multiset <int> m;
    numa(x,minus){
      m.insert(-x);
    }
    int g = 0;
    int tmp_zero = zero;
    numa(x,p){
      auto it = m.lower_bound(-x+1);
      if (it != m.end()){
        m.erase(it);
        ans_wet += 1;
      }else{
        if (tmp_zero > 0) {
          ans_wet += 1;
          tmp_zero -= 1;
        }else{
          g += 1;
        }
      }
    }
    ans_wet += g/2;
  }

  cout << ans_dry << " " << ans_wet << " " << ans_moist << endl;
  
  return 0;
}