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 S[1000000],N;
int binarySearch(int v){
int a=0;
int b=N;
int u;
int s[1000000];
while(a<b){
u=(a+b)/2;
if(v==S[u])
return 1;
if(v>S[u])
a=u+1;
else if(v<S[u])
b=u;
}

return 0;

}

int main(){
  
int i,k,q; 
int c =0;
   
    scanf("%d", &N);
     for ( i = 0; i < N; i++ ){ 
scanf("%d", &S[i]);
}
    
 scanf("%d", &q);
     for ( i = 0; i < q; i++ ){ 
scanf("%d", &k);

if(binarySearch(k))
c++;
}

   
  

      
  
   
    printf("%d\n",c);
   
    return 0;
}