import std.algorithm;
import std.array;
import std.ascii;
import std.container;
import std.conv;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.typecons;

void log(A...)(A arg) {
    stderr.writeln(arg);
}
int size(T)(in T s) {
    return cast(int)s.length;
}

void main() {
    int N; readf("%d\n", &N);
    auto A = readln.chomp.split(" ").map!(to!int).array;

    int m = 0;
    int z = 0;
    int[int] count;
    foreach (a; A) {
        if (a < 0) count[a] = count.get(a, 0) + 1;
        else if (a == 0) z++;
    }
    foreach (a; A) {
        if (count.get(-a, 0) > 0) {
            count[-a]--;
            m++;
        }
    }
    m += z / 2;

    int calc(int[] W, BinaryHeap!(int[], "a < b") PQ) {
        int ans = 0;
        foreach (i, w; W) {
            if (PQ.empty) {
                break;
            }
            while (! PQ.empty) {
                int c = PQ.front; PQ.removeFront;
                if (c < w) {
                    ans++;
                    break;
                }
            }
        }
        int x = min(W.size - ans, z);
        ans += x + (W.size - ans - x) / 2;
        return ans;
    }

    int w = calc( A.filter!"a > 0".array.sort!"a > b".array, A.filter!"a < 0".map!"-a".array.heapify );
    int d = calc( A.filter!"a < 0".map!"-a".array.sort!"a > b".array, A.filter!"a > 0".array.heapify );
    writefln("%s %s %s", d, w, m);


}