/* -*- coding: utf-8 -*-
 *
 * 190.cc: No.190 Dry Wet Moist - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;
const int MAX_NN = MAX_N * 2;

/* typedef */

/* global variables */

int as[MAX_NN];

/* subroutines */

/* main */

int main() {
  int n;
  cin >> n;
  int nn = n * 2;

  for (int i = 0; i < nn; i++) cin >> as[i];
  sort(as, as + nn);

  int dc = 0, wc = 0, mc = 0;

  for (int i = 0, j = nn - 1; i < j; i++) {
    while (j > i && as[j] >= -as[i]) j--;
    if (j <= i) break;
    //printf("d: as[%d]=%d -> as[%d]=%d\n", i, as[i], j, as[j]);
    dc++;
    j--;
  }

  for (int i = nn - 1, j = 0; i > j; i--) {
    while (j < i && as[j] <= -as[i]) j++;
    if (j >= i) break;
    //printf("w: as[%d]=%d -> as[%d]=%d\n", i, as[i], j, as[j]);
    wc++;
    j++;
  }

  for (int i = nn - 1, j = 0; i > j; i--) {
    while (j < i && as[j] < -as[i]) j++;
    if (j >= i) break;
    if (as[j] == -as[i]) {
      //printf("m: as[%d]=%d -> as[%d]=%d\n", i, as[i], j, as[j]);
      mc++;
      j++;
    }
  }

  printf("%d %d %d\n", dc, wc, mc);
  return 0;
}