import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } int N; int[] A; void main() { try { for (; ; ) { N = readInt(); A = new int[2 * N]; foreach (i; 0 .. 2 * N) { A[i] = readInt(); } A.sort; int ansN, ansP, ansZ; // negative auto setN = A.redBlackTree!true; for (; !setN.empty; ) { const a = setN.front; setN.removeFront; // max b s.t. a + b < 0 auto r = setN.lowerBound(-a); if (!r.empty) { ++ansN; setN.removeKey(r.back); } } // positive auto setP = A.redBlackTree!true; for (; !setP.empty; ) { const a = setP.back; setP.removeBack; // min b s.t. a + b > 0 auto r = setP.upperBound(-a); if (!r.empty) { ++ansP; setP.removeKey(r.front); } } // zero auto setZ = A.redBlackTree!true; for (; !setZ.empty; ) { const a = setZ.front; setZ.removeFront; if (setZ.removeKey(-a)) { ++ansZ; } } writeln(ansN, " ", ansP, " ", ansZ); } } catch (EOFException e) { } }