Problem:
Search II

You are given a sequence of n integers S and a sequence of different q integers T. Write a program which outputs C, the number of integers in T which are also in the set S.

Input

In the first line n is given. In the second line, n integers are given. In the third line q is given. Then, in the fourth line, q integers are given.

Output

Print C in a line.

Constraints

Elements in S is sorted in ascending order

n ≤ 100000

q ≤ 50000

0 ≤ an element in S ≤ 109

0 ≤ an element in T ≤ 109

Sample Input 1

5
1 2 3 4 5
3
3 4 1

Sample Output 1

3

Sample Input 2

3
1 2 3
1
5

Sample Output 2

0

Sample Input 3

5
1 1 2 2 3
2
1 2

Sample Output 3

2

Notes

Solution in C (judge verdict: Accepted)

#include<stdio.h>
int mothernum, mother[100000];
int binary(int aim)
{
 int Start, End, Center;
   Start  = 0;
   End    = mothernum;

   while(Start < End){
     Center = (End + Start) / 2;
     if(mother[Center] > aim){
       End   = Center;
     } else if(mother[Center] < aim){
       Start = Center + 1;
     } else if(mother[Center] == aim){
       return 1;
     }
   }

 return 0;

}
int main()
{
 int  kidsnum, kids[50000], i, Count=0,flag;
 
 scanf("%d", &mothernum);
 for (i = 0; i < mothernum; i++) {
   scanf("%d", &mother[i]);
 }
  
 scanf("%d", &kidsnum);
 for(i = 0; i < kidsnum; i++) {
   scanf("%d", &kids[i]);
 }

 for(i = 0; i< kidsnum; i++){
   flag = binary(kids[i]);
   if(flag==1){
     Count++;
   }
 }
 
 printf("%d\n",Count);

 return 0;
}