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 A[], int key, int n){
    int left=0, right=n, mid;
    while(left<right){
        mid=(left+right)/2;
        if (A[mid]==key){
            return mid;
        }else if (key<A[mid]){
            right=mid;
        }else{
            left=mid+1;
        }
    }
    return -1;
}

int main(){
    int num, i, j, q, bs, ans=0;
    scanf("%d", &num);
    int num_list[num];
    for(i=0; i<num; i++){
        scanf("%d", &num_list[i]);
    }
    scanf("%d", &q);
    int q_list[q];
    for(j=0; j<q; j++){
        scanf("%d", &q_list[j]);
    }
    for(j=0; j<q; j++){
        bs=binarySearch(num_list, q_list[j], num);
        if(bs != -1) ans++;
    }
    printf("%d\n", ans);
    return 0;
}