import algorithm, tables, sets, lists, intsets, critbits, sequtils, strutils, math, future
var
    N = stdin.readLine.parseInt
    L = newSeq[int](8)
    A = stdin.readLine.split.map(parseInt)
    idx: int
    amin:int = 0
    amax:int = 0
    v:int = 0
L.fill(0)
for i in 0..<N:
    idx = A[i] div 400
    if idx >= L.len:
        inc(v)
    else:
        inc(L[idx])
for i in 0..<L.len:
    if L[i] > 0:
        inc(amin)
    # if L[i] == 0 and v > 0:
    #     inc(L[i])
    #     dec(v)
if amin == 0:
    inc(amin)
# for i in 0..<L.len:
#     if L[i] > 0:
#         inc(amax)
echo amin, ' ', min(L.len, amin + v)