n = int(input())
a = [int(input()) for _ in range(n)]
a.sort()
p = 0
b = []
for x in range(1, 2 * n + 1):
    while p < n and a[p] < x:
        p += 1
    if p == n or a[p] != x:
        b.append(x)

min_score = 0
s, e = 0, n - 1
for x in a[::-1]:
    if x > b[e]:
        min_score += 1
        s += 1
    else:
        e -= 1

max_score = 0
s, e = 0, n - 1
for y in b[::-1]:
    if a[e] > y:
        max_score += 1
        e -= 1
    else:
        s += 1

print(min_score)
print(max_score)