#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

#define REP(i,s,e) for (i = s; i <= e; i++)
#define rep(i,n) REP (i,0,(int)(n)-1)
#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP (i,(int)(n)-1,0)
#define INF (int)1e8
#define MOD (int)(1e9+7)

typedef long long ll;

int main(void) {
    int i, n;
    cin >> n;
    vector<int> pos, neg;
    int zero = 0;
    rep (i,n*2) {
        int a;
        cin >> a;
        if (a > 0)
            pos.push_back(a);
        else if (a < 0)
            neg.push_back(a);
        else
            zero++;
    }
    sort(pos.begin(),pos.end());
    sort(neg.begin(),neg.end(),greater<int>{});
    // dry
    int ans;
    ans = i = 0;
    for (auto x : pos) {
        while (i < neg.size() && neg[i] + x >= 0) i++;
        if (i == neg.size()) break;
        ans++; i++;
    }
    int v;
    v = min((int)neg.size()-ans,zero);
    ans += v + max(0,(int)neg.size()-v-ans)/2;
    cout << ans << " ";

    // wet
    ans = i = 0;
    for (auto x : neg) {
        while (i < pos.size() && pos[i] + x <= 0) i++;
        if (i == pos.size()) break;
        ans++; i++;
    }
    v = min((int)pos.size()-ans,zero);
    ans += v + max(0,(int)pos.size()-v-ans)/2;
    cout << ans << " ";

    // moist
    int j;
    ans = zero / 2;
    i = j = 0;
    while (i < pos.size() && j < neg.size()) {
        if (pos[i] + neg[j] == 0)
            ans++, i++, j++;
        else if (pos[i] + neg[j] > 0)
            j++;
        else
            i++;
    }
    cout << ans << endl;
    return 0;
}