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

from math import factorial

C = lambda n,k: factorial(n)//(factorial(n-k)*factorial(k))

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
for i in range(count):
    for j in range(count,2*N):
        if A[i] + A[j] == 0:
            Moist += 1
        if A[i] + A[j] > 0:
            Wet += 1
        if A[i] + A[j] < 0:
            Dry += 1

Wet = Wet//2
Dry = Dry//2
Wet = max(Wet,(2*N-count)//2)
Dry = max(Dry,(count)//2)

print(Dry,Wet,Moist)