You are given a sequence of positive integers of length N, a = (a_1, a_2, ..., a_N). Your objective is to remove some of the elements in a so that a will be a **good sequence**.  Here, an sequence b is a **good sequence** when the following condition holds true:    * For each element x in b, the value x occurs exactly x times in b.  For example, (3, 3, 3), (4, 2, 4, 1, 4, 2, 4) and () (an empty sequence) are good sequences, while (3, 3, 3, 3) and (2, 4, 1, 4, 2) are not.  Find the minimum number of elements that needs to be removed so that a will be a good sequence.
n = int(input())
a = list(map(int, input().split()))
a.sort()
now = a[0]
ans = 0
count = 0
print(a)
for i in range(n):
    if(now != a[i]):
        if(count < now):
            ans += count
        now = a[i]
        count = 0
    count += 1
    if(count > now):
        ans += 1
    if(i == n - 1):
        if(count < now):
            ans += count
print(ans)

n = int(input())
a = list(map(int, input().split()))
a.sort()
now = a[0]
ans = 0
count = 0
for i in range(n):
    if(now != a[i]):
        if(count < now):
            ans += count
        now = a[i]
        count = 0
    count += 1
    if(count > now):
        ans += 1
    if(i == n - 1):
        if(count < now):
            ans += count
print(ans)
