#include <cstdio>
#include <algorithm>
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;int n,a[200005];int f(){int ans = 0;for(int i=0,j=n-1;i<j;){while(i<j&&a[i]+a[j]<=0)++i;if (i < j)ans++,++i,--j;}return ans;}int g(){int ans=0;for (int i=0,j=n-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);n*=2;rep(i,n)scanf("%d",a+i);sort(a,a+n);int x=f();rep(i,n)a[i]*=-1;sort(a,a+n);printf("%d %d %d\n",f(),x,g());return 0;}