CF137B.Permutation

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

"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<=n<=5000$ ) which represents how many numbers are in the sequence. The second line contains a sequence of integers $a_{i}$ ( $1<=a_{i}<=5000,1<=i<=n$ ).

输出格式

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

输入输出样例

输入#1
```
3
3 1 2
```
输出#1
```
0
```
输入#2
```
2
2 2
```
输出#2
```
1
```
输入#3
```
5
5 3 3 3 1
```
输出#3
```
2
```

说明/提示

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.

首页