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 <string.h>

int binarySearch(int *, int, int);

main(){
  int n,q,i,count=0;
  int *sAry,*tAry;

  scanf("%d", &n);
  sAry = malloc(n*sizeof(int));
  for(i=0; i<n; i++) scanf("%d", sAry+i);
  scanf("%d", &q);
  tAry = malloc(q*sizeof(int));
  for(i=0; i<q; i++) scanf("%d", tAry+i);

  for(i=0; i<q; i++)
    count += binarySearch(sAry, n, tAry[i]);

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

  return 0;
}

binarySearch(int *ary, int n, int a){
  int right,mid,left;  //search用

  right=n; //右端の１つ後
  left=0; //左端

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