import sys

sys.setrecursionlimit(10 ** 6)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))

def main():
    n = II()
    aa = LI()
    aa.sort()

    neg = 0
    i, j = 0, 2 * n - 1
    while i < j:
        if aa[i] + aa[j] < 0:
            neg += 1
            i, j = i + 1, j - 1
        else: j -= 1

    pos = 0
    i, j = 0, 2 * n - 1
    while i < j:
        if aa[i] + aa[j] > 0:
            pos += 1
            i, j = i + 1, j - 1
        else: i += 1

    equ = 0
    i, j = 0, 2 * n - 1
    while i < j:
        if aa[i] + aa[j] == 0:
            equ += 1
            i, j = i + 1, j - 1
        elif aa[i] + aa[j] > 0: j -= 1
        else: i += 1

    print(neg, pos, equ)

main()