#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
#include <limits>


static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    int n;
    cin >> n;
    multiset<int> s, s2;
    vector<int> v(2*n);
    for (auto &&i : v) scanf("%d", &i), s.insert(i), s2.insert(-i);
    int wet = 0;
    while(!s.empty()){
        int x = *s.begin(); s.erase(s.begin());
        auto t = s.upper_bound(-x);
        if(t != s.end()){
            wet++; s.erase(t);
        }
    }
    int dry = 0;
    while(!s2.empty()){
        int x = *s2.begin(); s2.erase(s2.begin());
        auto t = s2.upper_bound(-x);
        if(t != s2.end()){
            dry++; s2.erase(t);
        }
    }
    s.clear();
    for (auto &&j : v) s.insert(j);
    int moist = 0;
    while(!s.empty()){
        int x = *s.begin(); s.erase(s.begin());
        if(s.count(-x)){
            moist++; s.erase(s.find(-x));
        }
    }
    printf("%d %d %d\n", dry, wet, moist);
    return 0;
}