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

function main(input){
    let int =parseInt;
    let lines = input.split("\n");
    let sLen = int(lines[0]);
    let tLen = int(lines[2]);
    let s = lines[1].split(" ").map(item=>int(item));
    let t = lines[3].split(" ").map(item=>int(item));
    let count = 0;

    
    for(let i=0;i<tLen;i++){
        let left = 0;
        let right = sLen;
        let middle =Math.floor((left+right)/2);
        
        while(left<right){
            middle =Math.floor((left+right)/2);
            if(s[middle]===t[i]){
                count++;
                break;
            }else if(s[middle]>t[i]){
                right = middle;
            }else{
                left = middle+1;
            }
            

        }
    }
    console.log(count);
    
    
}


main(require("fs").readFileSync("/dev/stdin","utf-8"));