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>

bool binarySearch(int first, int last, int val, int * S) {
    if (first + 1 == last) {
        return val == S[first];
    }
    int idx = (first + last) / 2;

    if (val < S[idx]) {
        return binarySearch(first, idx, val, S);
    } else if (val > S[idx]) {
        return binarySearch(idx, last, val, S);
    } else if (val == S[idx]) {
        return true;
    }
    return false;
}


int main(int argc, char ** argv) {
    int n, q;
    std::cin >> n;
    int S[n];
    for (int i = 0; i < n; i++) {
        std::cin >> S[i];
    }

    std::cin >> q;
    int count = 0;
    for (int i = 0; i < q; i++) {
        int val;
        std::cin >> val;
        if (binarySearch(0, n, val, S)) {
            count++;
        }
    }

    std::cout << count << std::endl;
}