#!/usr/bin/env python
# -*- coding: utf-8 -*-

N = int(input())
A = list(map(int,input().split()))
A.sort()
Wet = 0
Dry = 0
Moist = 0
count = 0

while A[count] < 0:
    count+=1

j = 2*N
for i in range(count):
    max_n = j
    if count == max_n:
        Dry = i
        break
    for j in range(count,max_n)[::-1]:
        if A[i] + A[j] < 0:
            break
    else:
        Dry = 2*N-j
        break
else:
    Dry = count

A.sort(reverse=True)
count = 2*N-count
j = 2*N
for i in range(count):
    max_n = j
    if count == max_n:
        Wet = i
        break
    for j in range(count,max_n)[::-1]:
        if A[i] + A[j] > 0:
            break
    else:
        Wet = 2*N-j
        break
else:
    Wet = count

j = 2*N
for i in range(count):
    max_n = j
    if count == max_n:
        Moist = i
        break
    for j in range(count,max_n)[::-1]:
        if A[i] + A[j] == 0:
            break
    else:
        Moist = 2*N-j
        break
else:
    Moist = count

if count == 2*N:
    Wet = count//2
elif count == 0:
    Dry = count//2

print(Dry,Wet,Moist)