#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())
#define indexOf(v,x) (find(all(v),x)-v.begin())


int n,a[200000];
bool used[200000];

int Dry(){
	set<pair<int,int> ,greater<pair<int,int> > > s;
	set<pair<int,int> ,greater<pair<int,int> > >::iterator it;

	sort(a,a+2*n,greater<int>());
	rep(i,2*n)s.insert(make_pair(a[i],i));
	int res=0;
	memset(used,false,sizeof(used));
	rep(i,2*n){
		if(used[i])continue;
		s.erase(make_pair(a[i],i));
		it=s.upper_bound(make_pair(-a[i],0));
		if(it!=s.end()&&it->second!=i){
			res++;
			used[it->second]++;
			s.erase(it);
		}
	}
	return res;
}
int Wet(){
	set<pair<int,int> > s;
	set<pair<int,int> >::iterator it;

	sort(a,a+2*n);
	rep(i,2*n)s.insert(make_pair(a[i],i));
	int res=0;
	memset(used,false,sizeof(used));
	rep(i,2*n){
		if(used[i])continue;
		s.erase(make_pair(a[i],i));
		it=s.upper_bound(make_pair(-a[i],INF));
		if(it!=s.end()&&it->second!=i){
			res++;
			used[it->second]++;
			s.erase(it);
		}
	}
	return res;
}
int Moist(){
	multiset<int> s;
	multiset<int>::iterator it;
	int res=0;sort(a,a+2*n);
	rep(i,2*n){
		it=s.find(-a[i]);
		if(it!=s.end()){
			res++;
			s.erase(it);
		}
		else s.insert(a[i]);
	}
	return res;
}

int main(){
	cin>>n;
	rep(i,2*n)cin>>a[i];
	cout<<Dry()<<' '<<Wet()<<' '<<Moist()<<endl;
	return 0;
}