def main():
    from collections import Counter

    N = int(input())
    a = map(int, input().split())

    a = map(lambda x: min(8, x // 400), a)

    ctr = Counter(a)

    len_ = len(ctr.keys())
    free = ctr[8]
    if free:
        ma = len_ - 1 + free
        mi = len_ - 1
        ans = mi, ma
    else:
        ans = len_, len_
    print(*ans)


if __name__ == '__main__':
    main()

# import sys
# input = sys.stdin.readline
# 
# sys.setrecursionlimit(10 ** 7)
# 
# (int(x)-1 for x in input().split())
# rstrip()
#
# def binary_search(*, ok, ng, func):
#     while abs(ok - ng) > 1:
#         mid = (ok + ng) // 2
#         if func(mid):
#             ok = mid
#         else:
#             ng = mid
#     return ok
