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_A 100000
#define MAX_B 50000

int main(){

  int n_1,n_2,i,j,sum=0,key,left,right,mid,flag;
  int a[MAX_A],b[MAX_B];


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

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

  for( j=0 ; j<n_2 ; j++ ){
    key = b[j];
    left = 0;
    right = n_1;
    while( left < right ){
      mid = (left + right)/2;
      if( key == a[mid] ){
	flag = 1;
	break;
      }
      if( key > a[mid] ) left = mid+1;
      else if( key < a[mid] ) right = mid;
    }
    if( flag == 1 ){
      sum++;
      flag = 0;
    }
  }

  printf("%d\n",sum);
  return 0;

}