#define _CRT_SECURE_NO_WARNINGS
#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>
#define aLL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define F(i,j,k) fill(i[0],i[0]+j*j,k)
#define P(p) cout<<(p)<<endl;
#define EXISt(s,e) ((s).find(e)!=(s).end())
#define INF 1<<25
#define MAX 100000000
#define pb push_back
#define mp make_pair
using namespace std;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef pair<pair<int, int>, int> pp;
typedef long long ll;
int dx[] = { 0, 1, 0, -1 };
int dy[] = { -1, 0, 1, 0 };

int sttoi(std::string str) {
	int ret;
	std::stringstream ss; ss << str;
	ss >> ret;
	return ret;
}

bool sort_greater(const pair<string, int> &a, const pair<string, int> &b) {
	return a.second > b.second;
}
int gcd(int a, int b){
	if (b > a)swap(a, b);if (b == 0)return a;else{return gcd(b, a%b);}
}

int wet(multiset<int> V){
	int count = 0;
	while (V.size()){
		int top = *V.rbegin();
		V.erase(V.find(top));
		auto ite = V.lower_bound(-1*top + 1);
		if (ite != V.end()){
			count++;
			V.erase(ite);
		}
	}
	return count;
}

int moist(multiset<int> V){
	int count = 0;
	while (V.size()){
		int top = *V.begin();
		V.erase(V.begin());
		if (V.count(-top)){
			count++;
			V.erase(V.find(-top));
		}
	}
	return count;
}

void solve() {
	int n;
	cin >> n;
	multiset<int> v,v2;
	rep(i, 2*n){
		int a;
		cin >> a;
		v.insert(a);
		v2.insert(-a);
	}
	cout  << wet(v2) << " " << wet(v) << " " << moist(v) << endl;
}

int main() {
	solve();
	return 0;
}