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 MAX_S 100000
#define MAX_T 50000

int main(){
  int i, j, n, q, cnt=0;
  int left=0, right=0, mid=0;
  int S[MAX_S], T[MAX_T];

  scanf("%d", &n);
  right = 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;
    while(left < right){
      mid = (left+right) / 2;
      if(S[mid] == T[i]){
	cnt++;
	break;
      }
      else if(T[i] < S[mid]){
	right = mid;
      }
      else{
	left = mid+1;
      }
      //printf("left__%d, right__%d\n", left, right);
    }
  }

  printf("%d\n", cnt);
  return 0;
  
  /*
    for(i=0; i<n; i++){
    printf("%d ", S[i]);
    }printf("\n");
    for(i=0; i<q; i++){
    printf("%d ", T[i]);
    }
  */
}