#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
int N;

int dry(vector<int> A) {
    int ans = 0;
    while(A.size()>1) {
        int sum = A[0] + A[A.size()-1];
        if (sum < 0) {
            ans++;
            A.erase(A.begin());
            A.erase(A.end()-1);
        }
        else {
            A.erase(A.end()-1);
        }
    }
    return ans;
}
int wet(vector<int> A) {
    int ans = 0;
    while(A.size()>1) {
        int sum = A[0] + A[A.size()-1];
        if (sum > 0) {
            ans++;
            A.erase(A.begin());
            A.erase(A.end()-1);
        }
        else {
            A.erase(A.begin());
        }
    }
    return ans;
}
int moist(vector<int> A) {
    int ans = 0;
    while(A.size()>1) {
        int sum = A[0] + A[A.size()-1];
        if (sum==0) {
            ans++;
            A.erase(A.begin());
            A.erase(A.end()-1);
        }
        else if (sum > 0) {
            A.erase(A.end()-1);
        } else {
            A.erase(A.begin());
        }
    }
    return ans;
}

void solve() {
    cin>>N;
    vector<int> A(2*N);
    REP(i,2*N)cin>>A[i];
    sort(ALL(A));
    out("%lld %lld %lld\n", dry(A), wet(A), moist(A));
}