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 binarySearch(int *, int, int);

int main(){
  int N[100000]; int Q[50000];
  int nnum, qnum;
  int i, j, count = 0;
  
  scanf("%d", &nnum);
  for(i = 0; i < nnum; i++){
    scanf("%d", &N[i]);
  }
  scanf("%d", &qnum);
  for(i = 0; i < qnum; i++){
    scanf("%d", &Q[i]);
  }
  
  for(i = 0; i < qnum; i++){
    if(binarySearch(N, nnum, Q[i]) == 1){
      count++;
    }
  }
  
  printf("%d\n", count);
  return 0;
}

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