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 PHP (judge verdict: WA: Presentation Error)

<?php
$lengthA = (int) fgets(STDIN);
$stdinA = explode(" ",fgets(STDIN));

$lengthKey = (int) fgets(STDIN);
$stdinKey = explode(" ",fgets(STDIN));

$count = 0;
for($j=0; $j<$lengthKey; ++$j){
    $result = BinarySearch($lengthA, $stdinA, $stdinKey[$j]);
    if($result == 1){
        $count++;
    }
}
echo $count . PHP_EOL;

function BinarySearch($N, $A, $key){
    $left = 0;
    $right = $N;
    while ($left < $right){
        //探索の範囲内の中央の要素を調べる
        $mid = ($left + $right) / 2;
        //目的のキーと中央の要素のキーが一致すれば探索を終了
        if ((int)$A[$mid] == (int)$key){
            return 1;
        }
        //前半部分を探索範囲とする
        if ($key < $A[$mid]){
            $right = $mid;
        }
        //後半部分を探索範囲とする
        else{
            $left = $mid + 1;
        }
    }
    return 0;
}
?>