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 judge(int * ,int );

int main(){

  int i,j,m,n;
  int a[100005],b[50005];
  int le,mid,ri,key=0;
  int cnt=0,flag=0;
  int num,tmp;

   


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

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


  /*
 
  for(i=0;i<m;i++){
 
      for(j=m-1;j >= i+1;j--){     
	if(a[j-1] > a[j]){
	  tmp = a[j-1];
	  a[j-1]=a[j];
	  a[j]=tmp;
	
	}
      }
  
    }
  */
  
  for(j=0;j<n;j++){
    le=0;
    ri=m;
    key =b[j];

    //   printf("あああ\n");
    while(le < ri ){
      mid=(le+ri)/2;
      
      if(key == a[mid]){
        cnt++;
	//	printf("あああhoge\n");
	break;
      }
      
      if(key > a[mid]){
        le  = mid+1;
	//	printf("いいいhoge\n");
	continue;
      }

      if(key < a[mid]){
        ri = mid;
	//  printf("うううhoge\n");
	continue;
      }
      mid=(le+ri)/2; 
    }
    
  }

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


  
  return 0;
}