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,B[1000000];
  int i,u;
  int l,m,r;
  int count=0,flag,key;
  
  scanf("%d",&n);
  S=(int *)malloc(n*sizeof(int));
  for(i=0;i<n;i++) scanf("%d",&S[i]);
  scanf("%d",&q);
  T=(int *)malloc(q*sizeof(int));
  for(i=0;i<q;i++) scanf("%d",&T[i]);


  for(i=0;i<q;i++){
    key=T[i];
    l=0;
    r=n+2;
    m=(r+l)/2;
    flag=0;

    for(u=0;u<count;u++){
      if(B[u]==key){
	flag=1;
	break;
      }
    }
    
    while(r>l){
      if(flag==1) break;
      if(key==S[m]){
	B[count++]=key;
	break;
      }
      else if(key<S[m]){
	r=m;
	m=(r+l)/2;
      }else if(key>S[m]){
	l=m+1;
	m=(r+l)/2;
      }
    }

  }

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

  free(S);
  free(T);
  return 0;
}