import sys
import copy
import  math
from _bisect import *
from collections import *
from operator import itemgetter
"""
from fractions import gcd
def lcm(x, y):
    return (x * y) // gcd(x, y)
"""
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

def judge(num):
    return bisect_right(rate, num) - 1


rate = [1, 400, 800, 1200, 1600, 2000, 2400, 2800, 3200, float("inf")]
li = [0] * 9
n = ni()
aaa = na()
for a in aaa:
    idx = judge(a)
    if idx == 8:
        li[idx] += 1
    else:
        li[idx] = 1
c = sum(li[:-1])
print(c, c + min(8 - c, li[-1]))