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 <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;
int a[100001];
int b[100001];

int binarySearch(int a[], int n, int data){
    int left = 0, right = n-1;
    while(left <= right){
        int mid = (left+right)/2;
        if(a[mid] == data){
            return mid;
        } else if(a[mid] < data){
            left = mid+1;
        }
        else{
            right = mid-1;
        }
    }
    return -1;
}
int main(){
    int n, m;
    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", &b[i]);
    }

    int cnt = 0;
    for(int i = 0; i < m; i++){
        if(binarySearch(a, n, b[i]) >= 0){
            cnt++;
        }
    }
    printf("%d\n", cnt);
    return 0;
}