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 main(){
  int  n, q;
  int *S,*T;
  int  i, m, r, l, c=0;

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

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

  /*calc the ans*/
  for(i=0; i<q; i++){
    l = 0;
    r = n;
    while(l < r){
      m = (l + r) / 2;
      if(S[m] == T[i]) {c++; break;}
      else if(S[m] > T[i]) r = m;
      else l = m + 1;
    }
  }
  /*print the ans*/
  printf("%d\n", c);

  return 0;
}