#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#include <bitset>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int naiveDP(const vector<int> &A, int typ) {
	int N = A.size();
	if(N > 26) abort();
	vector<int> okmask(N);
	rep(i, N) {
		rep(j, N) {
			int a = A[i] + A[j];
			bool b = typ == 0 ? a < 0 : typ == 1 ? a > 0 : a == 0;
			if(b)
				okmask[i] |= 1 << j;
		}
	}
	vector<char> dp(1 << N, -1);
	dp[0] = 0;
	int ans = 0;
	rep(i, 1 << N) {
		char x = dp[i];
		if(x == -1) continue;
		amax(ans, x);
		rep(j, N) if(~i >> j & 1) {
			int m = ~i & okmask[j];
			rep(k, j) if(m >> k & 1)
				amax(dp[i | 1 << j | 1 << k], x + 1);
		}
	}
	return ans;
}

int main() {
	int N;
	scanf("%d", &N);
	int N2 = N * 2;
	vector<int> A(N2);
	rep(i, N2) scanf("%d", &A[i]);
	sort(all(A));
	int dry = naiveDP(A, 0);
	int wet = naiveDP(A, 1);
	int moist = naiveDP(A, 2);
	printf("%d %d %d\n", dry, wet, moist);
	return 0;
}