#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

template<typename T>
struct BinaryIndexedTree{
    vector<T> data;
    int sz;

    BinaryIndexedTree(int n){
        sz = n + 2;
        data.assign(sz, 0);
    }

    void add(int i, T x){
        ++i;
        while(i < sz){
            data[i] += x;
            i += i & -i;
        }
    }

    // [0, i] の区間和
    T sum(int i){
        T res = 0;
        ++i;
        while(i > 0){
            res += data[i];
            i -= i & -i;
        }
        return res;
    }

    // [l, r) の区間和
    T sum(int l, int r){
        if(l > r)   return 0;
        return sum(r - 1) - sum(l - 1);
    }

    // val 以上を満たす 0-indexed の位置を返す
    int lower_bound(T val){
        // if(val <= 0)    return -1;
        int res = 0;
        int n = 1;
        while(n < sz)   n <<= 1;
        for(int k = n >> 1; k > 0; k >>= 1){
            if(res + k < sz && data[res + k] < val){
                val -= data[res + k];
                res += k;
            }
        }
        return res;     // 1-indexed であれば、res + 1 を返す
    }
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, Moist = 0, zero_cnt = 0;
    cin >> N;
    N *= 2;
    vector<vector<int>> A(2), compress(2, vector<int>(1, 0));
    vector<map<int, int>> cnt(2);
    for(int i = 0; i < N; ++i){
        int X;
        cin >> X;
        if(X == 0)  zero_cnt += 1;
        else{
            int j = X > 0;
            if(X < 0)   X *= -1;
            A[j].emplace_back(X);
            compress[j].emplace_back(X);
            cnt[j][X] += 1;
        }
    }

    Moist += zero_cnt / 2;
    for(auto& [key, val] : cnt[0]){
        if(cnt[1].find(key) != cnt[1].end()){
            Moist += min(val, cnt[1][key]);
        }
    }

    for(int i = 0; i < 2; ++i){
        sort(begin(compress[i]), end(compress[i]));
        compress[i].erase(unique(begin(compress[i]), end(compress[i])), end(compress[i]));
    }
    vector<int> ans(2);
    for(int i = 0; i < 2; ++i){
        int j = i ^ 1;
        int sz = compress[j].size();
        BinaryIndexedTree<int> bit(sz);
        bit.add(0, zero_cnt);
        for(auto& [key, val] : cnt[j]){
            int p = lower_bound(begin(compress[j]), end(compress[j]), key) - begin(compress[j]);
            bit.add(p, val);
        }
        int remain = 0;
        for(auto& [key, val] : cnt[i]){
            int upper = lower_bound(begin(compress[j]), end(compress[j]), key) - begin(compress[j]);
            int S = bit.sum(0, upper);
            if(S > 0){
                ans[i] += min(S, val);
                bit.add(0, -min(S, val));
                remain += val - (min(S, val));
            }
            else{
                remain += val;
            }
        }
        ans[i] += remain / 2;
    }

    cout << ans[0] << ' ' << ans[1] << ' ' << Moist << '\n';
    return 0;
}