#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <string.h>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <cctype>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rrep(i,n) for(int i = 1; i <= n; ++i)
#define drep(i,n) for(int i = n-1; i >= 0; --i)
#define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
inline int in() { int x; scanf("%d",&x); return x;}
inline void priv(vi a) { rep(i,sz(a)) printf("%d%c",a[i],i==sz(a)-1?'\n':' ');}

const int MX = 100005, INF = 1000010000;
const ll LINF = 1000000000000000000ll;
const double eps = 1e-10;
const int di[] = {-1,0,1,0}, dj[] = {0,-1,0,1}; //^<v>

int n, m;
int a[MX*2];

int sol() {
  int ans = 0;
  for (int i = 0, j = m-1; i < j;) {
    while (i < j && a[i]+a[j] <= 0) ++i;
    if (i < j) {
      ans++;
      ++i;
      --j;
    }
  }
  return ans;
}

int sol2() {
  int ans = 0;
  for (int i = 0, j = m-1; i < j;) {
    if (a[i]+a[j] > 0) {
      --j;
    } else if(a[i]+a[j] < 0) {
      ++i;
    } else {
      ans++;
      --j;
      ++i;
    }
  }
  return ans;
}

int main(){
  scanf("%d",&n);
  m = n*2;
  rep(i,m) scanf("%d",&a[i]);
  sort(a,a+m);
  int ans1 = sol();
  rep(i,m) a[i] = -a[i];
  sort(a,a+m);
  int ans2 = sol();
  int ans3 = sol2();
  priv({ans2,ans1,ans3});
  return 0;
}