Competitive Programming is very popular in Bangladesh. Shuvo is a contestant from DIU-SWE. His department is going to organize a Programming Contest for the junior contestant. Now Shuvo has to set a problem for the contest.
As Shuvo is an intelligent contestant, he wants to set a difficult problem as if no one can solve the problem. After thinking a few hours he gets a great idea of the problem.
Now think that there are N people in two groups and every person have an ID Number (1<=ID Number<=100). The groups are created by the people according to their behaviors. In this problem, you have to count the number of Common ID in two groups.
The first line contains one integer N (1<=N<=100) – the number of People in each group.
The second line contains ID Numbers of N People from the first group.
The third line contains ID Numbers of N People from the second group.
Print one integer – the number of Common ID from two groups.
5 1 3 6 15 21 3 8 15 19 25
1 43 69
In the first sample case the answer will be 2 because 3 and 15 are the common numbers in the two groups.
In the second sample case there don’t have any common number. So answer will be 0.