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>
#define NM 1000000
#define QM 50000
#define NOT_FOUND -1

int binarySearch(int *A,int key,int length){
  
  int mid,left = 0,right = length;
  
  while(left < right){
    mid = (left + right)/2;
    if(key == A[mid]) return mid;
    if(key > A[mid]) left = mid +1;
    else if(key < A[mid]) right = mid;
  }
  return NOT_FOUND;
}
  

int main(){

  int i,j,count=0,x,y,A[NM],B[QM],k;

  scanf("%d",&x);

  for(i=0;i<x;i++) scanf("%d",&A[i]);

  scanf("%d",&y);

  for(i=0;i<y;i++) scanf("%d",&B[i]);

  for(i=0;i<y;i++){

    k = binarySearch(A,B[i],x);
    if(k >= 0) count++;

  }
    

  printf("%d\n",count);

  return 0;
}