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)

/* 
 * File:   main.c
 * Author: s1252007
 *
 * Created on June 26, 2018, 11:39 AM
 */

#include <stdio.h>
#include <stdlib.h>
#define NIL -1

/*
 * 
 */

int BinarySearch(int *S, int n, int key);

int main(int argc, char** argv) {
    int n, q, checkSearch, counter = 0;
    int *S, *T;
    scanf("%d", &n);
    S = (int *)malloc(sizeof(int) * n);
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &S[i]);
    }
    scanf("%d", &q);
    T = (int *)malloc(sizeof(int) * q);
    for (int j = 0; j < q; j++)
    {
        scanf("%d", &T[j]);
    }
    
    for (int ix = 0; ix < q; ix++)
    {
        checkSearch = BinarySearch(S, n, T[ix]);
        if (checkSearch != NIL) counter++;
    }
    printf("%d\n", counter);
    return (EXIT_SUCCESS);
}

int BinarySearch(int *S, int n, int key)
{
    int left = 0, counter = 0, right = n;
    while (left < right)
    {
        int mid = (left + right)/2;
        if (key == S[mid]) return mid;
        if (key > S[mid]) left = mid + 1;
        else if (key < S[mid]) right = mid;
    }
    return NIL;
}