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

int main(){
  int len1,len2,A[100000],elem,sum=0;
  int i;

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

  scanf("%d",&len2);
  for(i=0;i<len2;i++){
    scanf("%d",&elem);
    sum+=binary(A,elem,len1);
  }

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

int binary(int *A,int elem,int len){
  int left=0,right=len,mid;
  
  while(left<right){
    mid=(left+right)/2;
    if(A[mid]==elem) return 1;
    if(A[mid]<elem) left=mid+1;
    else right=mid;
  }

  return 0;
}