n = int(input())
a = list(map(int, input().split()))
a_sorted = sorted(a)
size = 2 * n

# Calculate maximum Dry count
dry = 0
left, right = 0, size - 1
while left < right:
    current_sum = a_sorted[left] + a_sorted[right]
    if current_sum < 0:
        dry += 1
        left += 1
        right -= 1
    else:
        right -= 1

# Calculate maximum Wet count
wet = 0
left, right = 0, size - 1
while left < right:
    current_sum = a_sorted[left] + a_sorted[right]
    if current_sum > 0:
        wet += 1
        left += 1
        right -= 1
    else:
        left += 1

# Calculate maximum Moist count
moist = 0
left, right = 0, size - 1
while left < right:
    current_sum = a_sorted[left] + a_sorted[right]
    if current_sum == 0:
        moist += 1
        left += 1
        right -= 1
    elif current_sum > 0:
        right -= 1
    else:
        left += 1

print(dry, wet, moist)