CF137B Permutation

"Hey, it's homework time" — thought Polycarpus and of course he started with his favourite subject, IT. Polycarpus managed to solve all tasks but for the last one in 20 minutes. However, as he failed to solve the last task after some considerable time, the boy asked you to help him. The sequence of $ n $ integers is called a permutation if it contains all integers from $ 1 $ to $ n $ exactly once. You are given an arbitrary sequence $ a_{1},a_{2},...,a_{n} $ containing $ n $ integers. Each integer is not less than $ 1 $ and not greater than $ 5000 $ . Determine what minimum number of elements Polycarpus needs to change to get a permutation (he should not delete or add numbers). In a single change he can modify any single sequence element (i. e. replace it with another integer).

The first line of the input data contains an integer $ n $ ( $ 1

Print the only number — the minimum number of changes needed to get the permutation.

The first sample contains the permutation, which is why no replacements are required. In the second sample it is enough to replace the first element with the number 1 and that will make the sequence the needed permutation. In the third sample we can replace the second element with number 4 and the fourth element with number 2.