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

int k=0;
int num2;
int main(){
    int i,j,num1,first[100000],second[500000],same=0,left,right,mid;
    //一つ目の数列
    scanf("%d",&num1);
        for(int i=0;i<num1;i++){
            scanf("%d",&first[i]);
        }
    //二つ目の要素
    scanf("%d",&num2);
    for(i=0;i<num2;i++){
        scanf("%d",&second[i]);
    }
    for(i=0;i<num2;i++){
    k++;
    binary(first,num1,second[i]);
    }
    //printf("%d",k);
    return 0;
}

void binary(int *f,int num,int key){
  int left,right,mid;
  static int same=0;
     left=0;
     right=num;
        while(left<right){
            mid = (left + right)/2;
            if(f[mid]==key){
	      //printf("%d%d\n",f[mid],key);
                same++;
                break;
            }else if(key<f[mid]){
                right=mid;
            }else {
                left=mid+1;
            }
        }
	//printf("%d%d\n",k,num2);
	if(k==num2){
	  printf("%d\n",same);
	  }

}