#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i)) #define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i)) #define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i)) #if defined(_MSC_VER) || __cplusplus > 199711L #define aut(r,v) auto r = (v) #else #define aut(r,v) __typeof(v) r = (v) #endif #define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it) #define all(o) (o).begin(), (o).end() #define pb(x) push_back(x) #define mp(x,y) make_pair((x),(y)) #define mset(m,v) memset(m,v,sizeof(m)) #define INF 0x3f3f3f3f #define INFL 0x3f3f3f3f3f3f3f3fLL using namespace std; typedef vector vi; typedef pair pii; typedef vector > vpii; typedef long long ll; template inline void amin(T &x, U y) { if(y < x) x = y; } template inline void amax(T &x, U y) { if(x < y) x = y; } int main() { int N; scanf("%d", &N); int N2 = N * 2; vector A(N2); rep(i, N2) scanf("%d", &A[i]); sort(all(A)); const int X = 100000; vector cnt(X * 2 + 1); rep(i, N2) ++ cnt[X + A[i]]; int moist = 0; rer(x, 1, X) moist += min(cnt[X + x], cnt[X - x]); moist += cnt[X + 0] / 2; int neg = 0, pos = 0; rep(i, N2) { neg += A[i] < 0; pos += A[i] > 0; } int wetPairs = 0; for(int i = N2 - 1, j = 0; i >= 0; -- i) { int a = A[i]; if(a > 0) continue; for(; j < N2 && a + A[j] <= 0; ++ j) ; if(j < N2) { ++ wetPairs; ++ j; } } int wet = wetPairs + (pos - wetPairs) / 2; int dryPairs = 0; for(int i = 0, j = N2 - 1; i < N2; ++ i) { int a = A[i]; if(a < 0) continue; for(; j >= 0 && a + A[j] >= 0; -- j) ; if(j >= 0) { ++ dryPairs; -- j; } } int dry = dryPairs + (neg - dryPairs) / 2; printf("%d %d %d\n", dry, wet, moist); return 0; }