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

#include <iostream>
#include <algorithm>
using namespace std;

bool binary_search(int *s, int s_size, int num) {
    int left = 0, right = s_size - 1, mid;
    if (s[left] == num || s[right] == num) return true;
    
    while (right - left != 1) {
        mid = (left + right) / 2;
        if (s[mid] > num) {
            right = mid;
        }
        else if (s[mid] == num) return true;
        else {
            left = mid;
        }
    }
    
    return false;
}

int main() {
    int n; cin >> n;
    int s[n]; for (int i = 0; i < n; ++i) cin >> s[i];
    int q; cin >> q;
    int t[q]; for (int i = 0; i < q; ++i) cin >> t[i];
    
    int cnt = 0;
    for (int t_i = 0; t_i < q; ++t_i) {
        if (binary_search(s, n, t[t_i])) ++cnt;
    }
    cout << cnt << endl;
    return 0;
}