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 <stdbool.h>
#include <stdio.h>

// ref. http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_4_B

bool binary_search(int xs[], int len, int target) {
    int l = 0, h = len-1, mid;

    while (h >= l) {
        mid = (l + h) / 2;
        if (xs[mid] < target) {
            l = mid + 1;
        } else if (xs[mid] > target) {
            h = mid - 1;
        } else {
            return true;
        }
    }

    return false;
}

#define MAX_N 100000
#define MAX_Q 50000

int main(void) {
    int n;
    int xs[MAX_N];
    int q;
    int count = 0;

    scanf("%d\n", &n);

    for (int i = 0; i < n; i++) {
        int x;
        scanf("%d", &x);
        xs[i] = x;
    }

    scanf("%d\n", &q);
    
    for (int i = 0; i < q; i++) {
        int y;
        scanf("%d", &y);

        if (binary_search(xs, n, y)) {
            // printf("%d\n", y);
            count++;
        }
    }
    
    printf("%d\n", count);

    return 0;
}