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 N;
int M;
int A[100010];
int temp;
int res;


int binarySearch(int x){
    int left = 0;
    int right = N;
    int mid;
    while(left < right){
        mid = (left + right) / 2;
        if(A[mid] == x){
            return 1;
        } 
        else if(A[mid] > x){
            right = mid;
        }
        else{
            left = mid + 1;
        }
    }
    return 0;
}

int main(){
    //freopen("binarySearch.txt", "r", stdin);
    scanf("%d", &N);
    for(int i=0; i<N; i++){
        scanf("%d", &A[i]);
    }
    scanf("%d", &M);
    for(int i=0; i<M; i++){
        scanf("%d", &temp);
        if(binarySearch(temp)) res++;
    }
    printf("%d\n", res);
    return 0;
}