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 binarysearch(int ,int ,int *);
int main(){
  int i,ans=0,j,k,stuff1[100000],kazu1,kazu2,stuff2;
  scanf("%d",&kazu1);
  for(i=0;i<kazu1;i++){
    scanf("%d",&stuff1[i]);
  }
  scanf("%d",&kazu2);
  for(j=0;j<kazu2;j++){
    scanf("%d",&stuff2);
    ans+=binarysearch(stuff2,kazu1,stuff1);
  }
  printf("%d\n",ans);
  return 0;
}


int binarysearch(int key,int kazu1,int *stuff1){
  int left=0,right=kazu1,mid;
  while(left<right){
    mid=(left+right)/2;
    if(stuff1[mid]==key){
      return 1;
    }
    else if(key<stuff1[mid]){
      right=mid;
    }
    else {
      left=mid+1;
    }
  }
  return 0;
}