#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_DEPRECATE

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <limits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
#include <fstream>
#include <iterator>
#include <bitset>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;

#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)(c).size())
#define ten(x) ((int)1e##x)
#define tenll(x) ((ll)1e##x)

// #pragma comment(linker,"/STACK:36777216")

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> void chmax(T& l, const T r) { l = max(l, r); }
template<class T> void chmin(T& l, const T r) { l = min(l, r); }

int get_dry(vector<int> x){
	sort(x.begin(), x.end());
	int ans = 0;
	int r = sz(x) - 1;
	FOR(i, sz(x)){
		if (x[i] >= 0) break;
		while (r >= i && x[i] + x[r] >= 0) r--;
		if (r <= i) break;
		ans++;
		r--;
	}
	return ans;
}

int main() {
	int n;
	cin >> n;
	vector<int> a(2 * n);
	FOR(i,2*n) scanf("%d", &a[i]);
	int dry = get_dry(a);
	FOR(i, 2 * n) a[i] *= -1;
	int wet = get_dry(a);

	static int t[ten(5) + 10] = {};
	int zeros = 0;
	vector<int> mus;
	for (auto x : a) {
		if (x < 0) mus.push_back(-x);
		else if (x == 0)zeros++;
		else t[x]++;
	}

	int moist = zeros / 2;
	for (auto x : mus) {
		if (t[x]) {
			moist++;
			t[x]--;
		}
	}

	printf("%d %d %d\n", dry, wet, moist);


	return 0;
}