def solve(N, A):
    A.sort()

    i = 0
    j = len(A) - 1
    d = 0
    while i < j and A[i] <= 0:
        if -A[i] > A[j]:
            d += 1
            i += 1
            j -= 1
        else:
            j -= 1

    i = 0
    j = len(A) - 1
    w = 0
    while i < j and 0 <= A[j]:
        if -A[i] < A[j]:
            w += 1
            i += 1
            j -= 1
        else:
            i += 1

    i = 0
    j = len(A) - 1
    m = 0
    while i < j and A[i] <= 0 <= A[j]:
        s = A[j] + A[i]
        if s == 0:
            m += 1
            i += 1
            j -= 1
        elif s < 0:
            i += 1
        elif s > 0:
            j -= 1

    print(d, w, m)


def main():
    N = int(input())
    A = list(map(int, input().split()))
    solve(N, A)


if __name__ == '__main__':
    main()