P9845 [HackerEarth] naughty subly 3
普及
题目描述

Subly is a very naughty kid. His father gave a set of numbers to him. In the set no number is repeated and the set has N elements. He wanted Subly to keep that set safe. When his Father was busy watching a new season of his favourite TV series, Subly became bored. He started playing with the set of numbers that his father gave. He observed that he didn't like a few of the numbers in the set. So, he changed all numbers that he doesn't like to the number that he likes and is in the Set.

When his father came to know about this, he got very angry. He wants to find the numbers of elements that his son changed. But he also wants to continue watching the Series, as his favourite character is kidnapped and the plot is getting very exciting.

Can you help him identify how many numbers his son changed?

Input:

First Line contains a Number N denoting the number of elements in the set.
Next Line will contain N numbers. These numbers are the elements of the changed set.

Output:

A single Integer Denoting the answer.

Constraints:

1 ≤ N ≤ 100000

1 ≤ x ≤ 1000 ; x := An element of the changed Set

Example:

Input:
6

1 6 3 9 6 3
Output:
2
Input:
10

1 2 3 4 5 6 6 8 9 9
Output:
2

SAMPLE INPUT
6
1 6 3 9 6 3

SAMPLE OUTPUT
2

输入格式

见题面

输出格式

见题面

样例输入
6 1 6 3 9 6 3 SAMPLE
样例输出
2