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

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define UB upper_bound
#define LB lower_bound
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

int n, a[200000], b[200001], Z = 100000;

int f() { // + 同士を合成するパターンが抜けてる
	inc(i, 200001) { b[i] = 0; }
	
	inc(i, n) { b[Z + a[i]]++; }
	int c = 0, p = 1, r = 0;
	inc(i, 100001) {
		while(p <= i) { r += b[Z + p]; p++; }
		while(p <= 100000 && b[Z - i] != 0) {
			int m = min(b[Z - i], b[Z + p]);
			b[Z - i] -= m;
			b[Z + p] -= m;
			c += m;
			p++;
		}
	}
	return c + (r / 2);
}

int main() {
	cin >> n;
	n *= 2;
	inc(i, n) { cin >> a[i]; }
	
	int m = 0;
	inc(i, n) { b[Z + a[i]]++; }
	inc(i, 100001) { m += min(b[Z + i], b[Z - i]); }
	
	int w = f();
	inc(i, n) { a[i] *= -1; }
	int d = f();
	
	printf("%d %d %d\n", d, w, m);
	
	return 0;
}