#include <bits/stdc++.h>

#define rep(i, n) for (int (i) = 0; (i) < (int)(n); (i)++)

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;

const int MAXN = 211111;
int A[MAXN];

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    N <<= 1;
    for (int i = 0; i < N; i++) {
        cin >> A[i];
    }
    sort(A, A+N);
    int dry, wet, moist;
    {
        dry = 0;
        int s = 0, t = N-1;
        while (s < t) {
            while (s < t && A[s]+A[t] >= 0) t--;
            if (s >= t) break;
            dry++;
            s++;
            t--;
        }
    }
    {
        wet = 0;
        int s = 0, t = N-1;
        while (s < t) {
            while (s < t && A[s]+A[t] <= 0) s++;
            if (s >= t) break;
            wet++;
            t--;
            s++;
        }
    }
    {
        moist = 0;
        map<int, int> m;
        for (int i = 0; i < N; i++) m[A[i]]++;
        moist += m[0]/2;
        for (auto el : m) {
            if (el.first >= 0) break;
            moist += min(m[el.first], m[-el.first]);
        }
    }
    printf("%d %d %d\n", dry, wet, moist);
    return 0;
}