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>




typedef struct{
    int value;
    int done;
}data;


    

int BinarySearch(int n, int key, data *A){
    int Left = 0;
    int Right = n;
    int mid;
    while(Left < Right){
        mid = (Left + Right)/2;
        if(A[mid].value == key)return mid;
        if(key < A[mid].value){
            Right = mid;
        }
        else if(key > A[mid].value){
            Left = mid + 1;
        }
    }
    return -1;
    
}

int main() {

    int n;
    int m;
    scanf("%d",&n);
    data *input = (data*)malloc(n * sizeof(data));
    for (int i = 0; i < n; i++){
        scanf("%d",&input[i].value);
        
    }
    
    scanf("%d",&m);
    int key, track = 0, Pos = 0;
    for(int i = 0; i < m; i++){
        scanf("%d",&key);
         Pos = BinarySearch(n,key,input);
       if(Pos == -1)continue;
        if(input[Pos].done != 1){
        input[Pos].done = 1;
        track++;
        }
    }

    printf("%d",track);
    printf("\n");
    return 0;
}