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

int search(int *array, int n, int x) {
    int pl = 0;
    int pr = n - 1;
    
    while(pl <= pr) {
        int pc = (pl + pr) / 2;
        if(array[pc] == x) {
            return pc;
        } else if(array[pc] < x) {
            pl = pc + 1;
        } else if(x < array[pc]) {
            pr = pc - 1;
        }
    }
    
    return -1;
}

int main(void) {
    int n;
    scanf("%d", &n);

    int *s = malloc(n * sizeof(int));
    if(s == NULL) {
        return 1;
    }

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

    int q;
    scanf("%d", &q);

    int *t = malloc(q * sizeof(int));
    if(t == NULL) {
        return 1;
    }

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

    int cnt = 0;
    for(int i = 0; i < q; i++) {
        if(search(s, n, t[i]) != -1) {
            cnt++;
        }
    }

    printf("%d\n", cnt);

    free(s);
    free(t);
    return 0;
}