package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

func out(x ...interface{}) {
	fmt.Println(x...)
}

var sc = bufio.NewScanner(os.Stdin)

func getInt() int {
	sc.Scan()
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func getInts(N int) []int {
	ret := make([]int, N)
	for i := 0; i < N; i++ {
		ret[i] = getInt()
	}
	return ret
}

func getString() string {
	sc.Scan()
	return sc.Text()
}

// min, max, asub, absなど基本関数
func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func asub(a, b int) int {
	if a > b {
		return a - b
	}
	return b - a
}

func abs(a int) int {
	if a >= 0 {
		return a
	}
	return -a
}

func lowerBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] >= x
	})
	return idx
}

func upperBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] > x
	})
	return idx
}

func main() {
	sc.Split(bufio.ScanWords)
	N := getInt()
	a := getInts(2 * N)
	sort.Ints(a)

	wet := 0
	n := 0
	m := len(a) - 1
	for n < m {
		if a[m]+a[n] > 0 {
			wet++
			n++
			m--
		} else {
			n++
		}
	}
	dry := 0
	n = 0
	m = len(a) - 1
	for n < m {
		if a[m]+a[n] < 0 {
			dry++
			n++
			m--
		} else {
			m--
		}
	}

	x := make(map[int]int)
	for _, v := range a {
		x[abs(v)]++
	}
	moist := 0
	for _, e := range x {
		moist += e / 2
	}
	out(dry, wet, moist)
}