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>
#define NOT_FOUND 0

int binarySearch(int* A, int n, int key){
  int l=0,m,r=n;
  while(l<r){
    m = (l+r) / 2;
    if(key == A[m]) return 1;
    if(key >  A[m]) l = m+1;
    else if(key < A[m]) r = m;
  }
  return NOT_FOUND;
}

int main(){
  int i,c=0,n,q;
  int *S;
  int *T;

  // input and allocation
  scanf("%d", &n);
  S = (int *)malloc(sizeof(int) * n);
  for(i=0; i<n; i++) scanf("%d ", &S[i]);
  scanf("%d", &q);
  T = (int *)malloc(sizeof(int) * q);
  for(i=0; i<q; i++) scanf("%d ", &T[i]);

  // search
  for(i=0; i<q; i++) c = c+binarySearch(S, n, T[i]);

  // output
  printf("%d\n", c);

  return 0;
}