Question
Name Trick
In a classroom, Zara checks the morning attendance, but the roster seems odd with extra entries. Some playful students have listed their names multiple times. Determine how many students have repeated names in the roster.
Input
The first line of the input contains a single integer N - the number of names in the register.
The next N lines of the input each contains a string.
Constraints:
1 ≤ N ≤ 104
1 ≤ |Si| ≤ 100
The next N lines of the input each contains a string.
Constraints:
1 ≤ N ≤ 104
1 ≤ |Si| ≤ 100
Output
Find the number of mischievous students who have multiple names in the register.
Example
Sample Input
5
Newton
Einstein
Newton
Bohr
Einstein
Sample Output
2
Explaination
Only two students have repeated names in the register.
5
Newton
Einstein
Newton
Bohr
Einstein
Sample Output
2
Explaination
Only two students have repeated names in the register.