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 100000
#define max 50000
main(){

  int n[Max],q[max];
  int a,b,i,j,k,count=0,left,right,mid;

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

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




  for(k=0;k<b;k++){
    left=0;
    right=a;
    while(left<right){
      mid = (left+right)/2;
      if(n[mid]==q[k]){
	count++;
	break;
      }
      else if(q[k]<n[mid])
	right=mid;
      else
	left = mid+1;
    }
  }
  printf("%d\n",count);
  return 0;
}