Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
B. Permutation

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard output"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).

Input

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*).

Output

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

Examples

Input

3

3 1 2

Output

0

Input

2

2 2

Output

1

Input

5

5 3 3 3 1

Output

2

Note

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.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/04/2021 04:05:47 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|