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

const int kMAX_N = 100010;
const int kMAX_ABS_A = 100010;
int A[kMAX_N * 2];
int N;

int pos_count[kMAX_ABS_A], neg_count[kMAX_ABS_A];

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    cin >> N;

    for (int i = 0; i < 2 * N; i++) {
        cin >> A[i];
        if (A[i] >= 0) pos_count[A[i]]++;
        else neg_count[-A[i]]++;
    }

    sort(A, A + 2 * N);

    int left = 0, right = 2 * N - 1, wet = 0, dry = 0, moist = 0;
    while (left < right) {
        while (left < right && A[left] + A[right] <= 0) {
            left++;
        }
        if (left < right) {
            wet++;
        }
        left++;
        right--;
    }

    left = 0, right = 2 * N - 1;
    while (left < right) {
        while (left < right && A[left] + A[right] >= 0) {
            right--;
        }
        if (left < right) {
            dry++;
        }
        left++;
        right--;
    }

    for (int i = 0; i < kMAX_ABS_A; i++) {
        if (i == 0) moist += pos_count[i] / 2;
        else {
            moist += min(pos_count[i], neg_count[i]);
        }
    }
    cout << dry << " " << wet << " " << moist << endl;

    return 0;
}