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 NOT_FOUND -1
int array1[100000],array2[50000],num1;
int binary_search(int);

int main(){

  int i,num2,count=0;
  
  scanf("%d",&num1);

  for(i=0;i<num1;i++){
    scanf("%d",&array1[i]);
  }
  
  scanf("%d",&num2);

  for(i=0;i<num2;i++){
    scanf("%d",&array2[i]);
  }
   for(i=0;i<num2;i++){
    if(binary_search(array2[i])==NOT_FOUND);
    else count++;
  }
  
    printf("%d\n",count);
  
  return 0;
}

int binary_search(int key){

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