#include "bits/stdc++.h" using namespace std; int main() { int N; cin >> N; N *= 2; vector A(N); for (int i = 0; i < N; i++) { cin >> A[i]; } sort(A.begin(), A.end()); int ans[3]{0, 0, 0}; int j = N - 1; for (int i = 0; i < N; i++) { while (i < j && A[i] + A[j] >= 0) j--; if (A[j] <= 0) break; if (i < j){ ans[0]++; j--; } } j = N - 1; for (int i = 0; i < N; i++) { while (i < j && A[N - 1 - i] + A[N - 1 - j] <= 0) j--; if (A[N - 1 - j] <= 0) break; if (i < j){ ans[1]++; j--; } } map m; set s; for (int i = 0; i < N; i++) { m[A[i]] ++; if (A[i] >= 0) s.insert(A[i]); } for (auto i : s) { if (i < 0) continue; if (i == 0){ ans[2] += m[i] / 2; } else{ ans[2] += min(m[i], m[-i]); } } cout << ans[0] << " " << ans[1] << " " << ans[2] << endl; cin >> N; }