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,i,A[100000],r,q,j,cnt=0,left,right,mid,key,minj;

  scanf("%d",&n);
  for(i=0; i<n; i++){
    scanf("%d",&A[i]);
  }
  /*for(i=0; i<n-1; i++){
    minj=i;
    for(j=i; j<n; j++){
      if(A[j]<A[minj]){
	minj=j;
      }
    }
    r=A[i];
    A[i]=A[minj];
    A[minj]=r;
    }*/

  scanf("%d",&q);
  for(j=0; j<q; j++){
    //binarysearch
    scanf("%d",&key);
    left=0;
    right=n;
    while(left<right){
      mid=(left+right)/2;
      if(A[mid]==key){
	cnt++;
	break;
      }
      else if(key<A[mid])right=mid;
      else left=mid+1;
      //printf("cnt:%d key:%d A[mid]:%d j:%d left:%d mid:%d right:%d\n",cnt,key,A[mid],j,left,mid,right);
    }
  }

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

  return 0;
}