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 A[100000], n;

int bS(int k);

int main(){
  int i, j, q, k, sum=0;

  scanf("%d", &n);
  for(i=0;i<n;i++){
    scanf("%d", &A[i]);
  }
  
  scanf("%d", &q);
  for(j=0;j<q;j++){
    scanf("%d", &k);
    if(bS(k)) sum++;
  }
  printf("%d\n", sum);

  return 0;
}
  
  
int bS(int k){
  int l = 0;
  int r = n;
  int m;
  while(l < r){
    m=(l + r) / 2;
    if(k == A[m])return 1;
    if(k > A[m]) l = m + 1;
    else if(k < A[m]) r = m;
  }
  return 0;
}