import bisect
n = int(input())
a = list(map(int, input().split()))
a.sort()
color = 0
pre_rate = 0
free = 0
for i in range(1,9):
    if bisect.bisect_left(a, 400 * i) != pre_rate:
        color += 1
        pre_rate = bisect.bisect_left(a, 400 * i)
free = n - bisect.bisect_left(a,3200)
print("{} {}".format(max(1, color), min(8,free + color)))