#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>

#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;

using namespace std;


int inputValue(){
    int a;
    cin >> a;
    return a;
};

void inputArray(int * p, int a){
    rep(i, a){
        cin >> p[i];
    }
};

void inputVector(vector<int> * p, int a){
    rep(i, a){
        int input;
        cin >> input;
        p -> push_back(input);
    }
}

template <typename T>
void output(T a, int precision) {
    if(precision > 0){
        cout << setprecision(precision)  << a << "\n";
    }
    else{
        cout << a << "\n";
    }
}

int wet(multiset<int> M) {
    int num = 0;
    while (M.size()) {
        int v = * M.rbegin();
        M.erase(M.find(v));
        auto it = M.lower_bound(-v + 1);
        if(it != M.end()){
            num++;
            M.erase(it);
        }
    }
    return num;
}

int moist(multiset<int> M) {
    int num = 0;
    while (M.size()) {
        int v = * M.rbegin();
        M.erase(M.find(v));
        if (M.find(-v) != M.end()) {
            num++;
            M.erase(M.find(-v));
        }
    }
    return num;
}

multiset<int> P;
multiset<int> Q;

int main(int argc, const char * argv[]) {
    
    // source code
    int N = inputValue();
    
    rep(i, 2 * N){
        int x = inputValue();
        P.insert(x);
        Q.insert(-x);
    }
    
    cout << wet(Q) << " " << wet(P) << " " << moist(P) << endl;
    
    // Dry
    
    
    
    
    return 0;
}