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++14 (judge verdict: Accepted)

#include<iostream>
#include<cstdio>
static const int NMAX = 100001;

bool BinarySearch(int *arr, int N, int key);

int main() {
    int S[NMAX], times, n, q, key;

    times = 0;

    std::cin >> n;
    for (int i = 0; i < n; i++) {
        scanf("%d", &S[i]);
    }
    
    std::cin >> q;
    for (int i = 0; i < q; i++) {
        scanf("%d", &key);
        if (BinarySearch(S, n, key)) {
            times++;
        }
    }
    
    std::cout << times << std::endl;

    return 0;
}

bool BinarySearch(int *arr, int N, int key){
    int left, right, mid;

    left = 0;
    right = N;

    while (left < right) {
        mid = (left + right) / 2;  // integer truncation
        if (key == arr[mid]) {
            return true;
        } else if (key < arr[mid]) {
            right = mid;
        } else {
            left = mid + 1;
        }
    }
    
    return false;
}