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>
#define Max1 100000
#define Max2 50000
main(){
  int i;
  int n, q;
  int S[Max1], T[Max2];
  int left, right, mid, count = 0, key;

  scanf("%d", &n);
  for(i = 0; i < n; i++){
    scanf("%d", &S[i]);
  }
  scanf("%d", &q);
  for(i = 0; i < q; i++){
    scanf("%d", &T[i]);
  }

  for(i = 0; i < q; i++){

    left = 0;

    right = n;

    key =  T[i];

    while(left<right){

      if((left + right)%2 == 0) mid = (left + right)/2;

      else  mid = ( left + right -1)/2;

      if(key == S[mid]){count++;
        break;
      }

      else if(key < S[mid])right = mid;

      else if(key > S[mid])left = mid+1;
    }
  }
  printf("%d\n", count);

  return 0;

}