import bisect
n = int(input())
a = sorted(list(int(i) for i in input().split()))
minct= 0
ov32 = n-bisect.bisect_left(a,3200)
#400で割る
def calc(n):
    return (n //400)+1
a2 = list(map(calc, a))
for i in range(9):
 if i in a2:
  minct +=1
minans = 0 
if minct == 0 and ov32>=1:
 minans =1
else:
 minans = minct
if minct+ov32>= 8:
 maxans =8
else:
 maxans =minct+ov32
print(*[minans,maxans])