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 int_cmp(const int *a, const int *b)
{
  if (*a < *b)
    return (-1);
  else if (*a > *b)
    return (1);
  return (0);
}
 
 
int main()
{
  int n,q,i,x,j;
  int array_n[100000];
  int array_q[50000];
  int count=0;
 
  scanf("%d",&n);
  for (i=0;i<n;i++){
    scanf("%d",&array_n[i]);
  }
  qsort(array_n,n,sizeof(array_n[0]),(int(*)(const void*, const void*))int_cmp);
 
  scanf("%d",&q);
  for (i=0;i<q;i++){
    scanf("%d",&x);
    int l=0;
    int r=n-1;
    int m;
    while (l<=r){
      m=(l+r)/2;
      if (array_n[m]==x){
        count++;
        break;
      }else if(array_n[m]<x){
        l=m+1;
      }else if(array_n[m]>x){
        r=m-1;
      }
    }
  }
 
  printf("%d\n",count);
 
  return 0;
}