from collections import Counter as C
N=input()*2;D=[];W=[]
def f(A,B,n,m):
	c=i=0
	for a in A:
		while i<m and a>=B[i]:i+=1
		if i^m:c+=1;i+=1
	n-=c
	return c+min(n,N)+max(0,n-N)/2
for a in map(int,raw_input().split()):D+=[a]*(a<0);W+=[-a]*(a>0)
D.sort();W.sort();d=len(D);w=len(W);N-=d+w;E=C(D);X=C(W)
print f(D,W,d,w),f(W,D,w,d),N/2+sum(min(E[k],X[k]) for k in E)