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 <iostream>


using namespace std;


void insertion_sort(unsigned int S[], int n)
{
    for (int i = 1; i < n; i++) {
        int j;
        unsigned int v;
        j = i - 1;
        v = S[i];
        while (j >= 0 && S[j] > v) {
            S[j + 1] = S[j];
            j--;
        }
        S[j + 1] = v;
    }
}


bool binary_search(unsigned int S[], int n, unsigned int t)
{
    int l, r, m;
    l = 0;
    r = n;
    while (r - l > 0) {
        m = (l + r) / 2;
        if (S[m] == t)
            break;
        if (S[m] < t)
            l = m + 1;
        else
            r = m;
    }

    return S[m] == t;
}


int main(void)
{
    unsigned int S[100000];
    unsigned int t;

    int n, q;

    cin >> n;
    for (int i = 0; i < n; i++)
        cin >> S[i];

    insertion_sort(S, n);

    int cnt = 0;
    cin >> q;
    for (int i = 0; i < q; i++) {
        cin >> t;
        if (binary_search(S, n, t))
            cnt++;
    }

    cout << cnt << endl;
}