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 main(){
  int i, j, S[100000], T[50000], n, q, left, right, mid, cnt=0, flag=0;
  scanf("%d", &n);
  if(n > 0 && n <= 100000){
    for(i = 0; i < n; i++){
      scanf("%d", &S[i]);
      if(i > 0){
	if(S[i-1] > S[i] || S[i] > 1000000000) flag = 1;
      }
    }

    if(flag != 1){
      scanf("%d", &q);
      if(q > 0 && q <= 50000){
	for(i = 0; i < q; i++){
	  scanf("%d", &T[i]);
	  if(T[i] > 1000000000) flag = 1;
	}
	if(flag != 1){
	  for(j = 0; j < q; j++){
	    left = 0;
	    right = n;
	    while(left < right){
	      mid = (left + right) / 2;
	      if(S[mid] == T[j]){
		cnt++;
		break;
	      }else if(T[j] < S[mid]){
		right = mid;
	      }else{
		left = mid + 1;
	      }
	    }
	  }
      
	  printf("%d\n", cnt);
	}
      }
    }
  }
  return 0;
}