#include<bits/stdc++.h>
using namespace std;

#define int long long

typedef long long ll;
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
template<class T,class U>inline void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>inline void chmax(T &t,U f){if(t<f)t=f;}

int N;
int A[200000];

signed main(){
    cin>>N;
    map<int,int>cnt;
    rep(i,2*N)cin>>A[i],cnt[A[i]]++;
    int D=0,W=0,M=0;

    each(it,cnt){
        if(it->fi<0)continue;
        if(!cnt.count(-it->fi))continue;
        M+=min(it->se,cnt[-it->se]);
    }

    multiset<int>s;
    rep(i,2*N)s.insert(A[i]);
    while(s.size()>=2){
        int tmp=*s.rbegin();
        auto it=s.rbegin();
        s.erase((++it).base());
        while(s.size()&&*s.begin()+tmp<=0)s.erase(*s.begin());
        if(s.size()){
            W++;
            s.erase(s.begin());
        }
    }

    s.clear();
    rep(i,2*N)s.insert(A[i]);
    while(s.size()>=2){
        int tmp=*s.begin();
        s.erase(s.begin());
        while(s.size()&&*s.rbegin()+tmp>=0)s.erase(*s.rbegin());
        if(s.size()){
            D++;
            auto it=s.rbegin();
            s.erase((++it).base());
        }
    }

    cout<<D<<" "<<W<<" "<<M<<endl;
    return 0;
}