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>

int C = 0;

void binary_search(int *s, int size, int t){
  int l, m, r;

  l = 0;
  r = size - 1;

  while(l <= r){
    m = (r + l)/2;

    if(s[m] == t){
      C++;
      break;
    }
    else if(s[m] < t){
      l = m +1;
    }
    else{
      r = m -1;
    }
  }
};

int main(){

  int *S, *T,n,N,i,j;

  scanf("%d",&n);
  S = (int *)malloc(sizeof(int)*n);

  for(i=0; i<=n-1; i++){
    scanf("%d",&S[i]);
  }
  
  scanf("%d",&N);
  T = (int *)malloc(sizeof(int)*N);
  for(i=0; i<=N-1; i++){
    scanf("%d",&T[i]);
  }

  //二分探査
  for(i=0;i<=N-1; i++){
    binary_search(S, n, T[i]);
  }


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

  return 0;
}