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++14 (judge verdict: Accepted)

#include<iostream>
#include<stdio.h>
#include<algorithm>

using namespace std;

int A[1000000], n;

int main(){
    cin >>n;
    for(int i = 0; i < n; i++){
        scanf("%d", &A[i]);
    }
    
    int q, k, sum = 0;
    cin >>q;
    for(int i = 0; i < q; i++){
        scanf("%d", &k);
        //標準ライブラリのlower_boundを使用
        if(*lower_bound(A, A + n, k) == k)sum++;
    }
    
    cout << sum << endl;
    
    return 0;
}