#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; const double PI = 3.14159265358979323846; const double EPS = 1e-12; const int INF = 1<<25; typedef pair P; typedef long long ll; typedef unsigned long long ull; map dc; int main(){ int n; cin>>n; n *= 2; vector d(n); for(int i = 0; i < n; i++) cin>>d[i]; sort(d.begin(), d.end()); // for(int i = 0; i < n; i++) ++dc[d[i]]; ll res[3] = {}; int pos = n-1; // while(pos>=0 && d[0]+d[pos]>=0) pos++; for(int i = 0; i < n; i++){ while(pos>i && d[i]+d[pos]>=0) pos--; if(pos<=i){ res[0] = i; break; } pos--; } pos = 0; for(int i = n-1; i >= 0; i--){ while(pos=i){ res[1] = n-i-1; break; } pos++; } pos = n-1; for(int i = 0; i < n; i++){ while(pos>i&& d[i]+d[pos]>0) pos--; if(pos<=i) break; if(d[i]+d[pos]==0){ res[2]++; pos--; } } printf("%ld %ld %ld\n", res[0], res[1], res[2]); return 0; }