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>
#include<stdlib.h>
#include<math.h>

int binarySearch(int,int *,int);
int main(){
  int n,q,*S,i,key,cnt=0;
  while(1){
    
    scanf("%d",&n);
    if(n<=pow(10,5)) break;
  }
     S = (int *)malloc((n+1)*sizeof(int));
    for(i=0;i<n;i++){
      scanf("%d",&S[i]);
      if(S[i]<0&&S[i]>pow(10,9)) exit(2);
    }
     while(1){
    
    scanf("%d",&q);
    if(q<=pow(10,4)*5) break;
  }

 for(i=0;i<q;i++){
      scanf("%d",&key);
      if(key<0||key>pow(10,9)) exit(2);
      if(binarySearch(key,S,n)) cnt++;
 }
 printf("%d\n",cnt);
 return 0;
}

int binarySearch(int key,int *S,int n){
  
  int left =0,right=n,mid;

  while(left <right) {
    mid = (left + right)/2;
    if(S[mid] ==key) return 1;
    else if(key<S[mid]) right = mid;
    else left = mid +1;
   
    
  }
  return 0;
  
}