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)

var input = require('fs').readFileSync('/dev/stdin', 'utf8');
var Arr=(input.trim()).split("\n");
var a=Arr[1].split(" ").map(Number);
var b=Arr[3].split(" ").map(Number);
var cnt=0;
var len=a.length;
var ab=0;
for(var i=0;i<b.length;i++){
   if(i!=0 && ab==b[i])continue;
   if(binarySearch(b[i]))cnt++;
   ab=b[i];
}
 console.log(cnt);

function binarySearch(key){
    var left = 0;
    var right = len;
    while( left < right){
        var mid =Math.floor((left + right)/2);
        if (a[mid] == key) {return true;}
        else if (key < a[mid]) {right = mid;}
        else {left = mid + 1;}
    }
    return false;
}