#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

vi A;
int f(){
    multiset<int> ms(all(A));
    int res = 0;

    while(sz(ms) >= 2){
        auto a = ms.begin();
        auto b = ms.lower_bound(-*a);
        if(b != ms.begin())--b;
        if(*a >= 0 || a == b)break;
        ++res;
        ms.erase(a);
        ms.erase(b);
    }
    return res;
}

int main(){
    int N, d, w, m;
    map<int, int> cnt;

    cin >> N;
    N *= 2;
    A = vi(N);
    rep(i, N)scanf("%d", &A[i]);
    d = w = m = 0;

    rep(i, N)if(A[i] >= 0)cnt[A[i]]++;
    m = cnt[0] / 2;
    rep(i, N)if(A[i] < 0 && cnt[-A[i]]>0){
        --cnt[-A[i]];
        m++;
    }

    d = f();
    rep(i, N)A[i] *= -1;
    w = f();

    printf("%d %d %d\n", d, w, m);
}