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 n=0,m=0,i=0,L=0,M=0,R=0,c=0;

  scanf("%d",&n);

  int S[n];

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

  scanf("%d",&m);

  int T[m];

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

  for(i=0; i < m; i++){
    L = 0;
    R = n;
    while(L < R){
      M = (L + R)/2;
      if(S[M] == T[i]){
	T[i] = -1;
	c++;
	break;
      } else if(T[i] < S[M]){
	R = M;
      } else {
	L = M + 1;
      }
    }
  }

  printf("%d\n",c);

  return 0;
}