#include <cstdio>
#include <vector>
#include <algorithm>
#include <functional>

int c1[100001], c_1[100001], c0;
std::vector<int> v;                 

int count(){
    int n = v.size(), res = 0;

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

    return res;
}

int main(){
    int N;
    scanf("%d", &N);

    c0 = 0;
    for(int i=0;i<2*N;i++){
        int a;
        scanf("%d", &a);

        if(a > 0){
            c1[a] += 1;
        }else if(a == 0){
            c0 += 1;
        }else{
            c_1[-a] += 1;
        }

        v.push_back(a);
    }

    int dry = 0, wet = 0, moist = c0 / 2;
    for(int i=1;i<=100000;i++){
        moist += std::min(c1[i], c_1[i]);
    }

    std::sort(v.begin(), v.end());
    wet = count();
    
    std::reverse(v.begin(), v.end());
    std::transform(v.begin(), v.end(), v.begin(), std::negate<int>());

    dry = count();

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