#include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os, const map<T,U>& mp){ os << "{"; for(auto& p : mp){ os << p << ","; } os << "}"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
using ll = long long;
using ull = unsigned long long;
using pii = std::pair<int,int>;
using vi = std::vector<int>;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
//constexpr double eps = 1e-14; 
constexpr double eps = 1e-10; 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/


template<typename T>
ostream& operator<<(ostream& os, const multiset<T>& st){
    os << "{";
    for(auto s : st) os << s << ",";
    os << "}";
    return os;
}


constexpr int max_a = 100005;
int x[max_a];
int y[max_a];

int main(){
    int n; cin >> n;
    vector<int> a(2*n); rep(i,2*n) cin >> a[i];

    int zero = 0;
    rep(i,2*n){
        if(a[i] > 0){
            x[a[i]]++;
        }else if(a[i] < 0){
            y[-a[i]]++;
        }else{
            zero++;
        }
    }

    int moist = zero/2;
    for(int i=0;i<max_a;i++){
        moist += min(x[i],y[i]);
    }

    int dry = 0; // 合計が負
    {
        multiset<int> positive, negative;
        for(auto v : a){
            if(v >= 0){
                positive.insert(v);
            }else{
                negative.insert(v);
            }
        }

        int cnt = negative.size();
        for(auto neg : negative){
            auto iter = positive.lower_bound(-neg);
            if(iter != positive.begin()){
                cnt--;
                iter--;
                dry++;
                positive.erase(iter);
            }
        }

        dry += cnt / 2;
    }

    int wet = 0; // 合計が正
    {
        multiset<int> positive, negative;
        for(auto v : a){
            if(v > 0){
                positive.insert(v);
            }else{
                negative.insert(v);
            }
        }

        //cout << positive << "\n" << negative << endl;
        int cnt = positive.size();
        for(auto pos : positive){
            auto iter = negative.upper_bound(-pos);
            if(iter != negative.end()){
                cnt--;
                //cout << pos << " " << *iter << endl;
                wet++;
                negative.erase(iter);
            }
        }
        wet += cnt/2;
    }

    cout << dry << " " << wet << " " << moist << endl;
}