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 N 100000
#define M 50000

int binarySearch(int*, int, int);

int main(){
    int A[N];
    int B[M];
    int i, j, x, y;
    int judge = 0;
    int cont = 0;
    int flag = 0;
    
    scanf("%d", &x);
    for(i=0 ; i<x ; i++){
        scanf("%d", &A[i]);
    }
    
    scanf("%d", &y);
    for(j=0 ; j<y ; j++){
        scanf("%d", &B[j]);
        judge = binarySearch(A, B[j], x);
        if(judge != 0){
            cont++;
            flag = 1;
        }
    }
    
    if(flag==0){
        printf("0\n");
    }else{
        printf("%d\n", cont);
    }
    
    return 0;
}

int binarySearch(int* aa, int key, int n){
    int i;
    int mi;
    int left = 0,right;
    
    right = n;
    
    while(left<right){
        mi = (left + right) / 2;
        if(aa[mi]==key){
            return 1;
        }else if(key<aa[mi]){
            right = mi;
        }else{
            left = mi + 1;
        }
    }
    
    return 0;
}