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: Wrong Answer)

function indexB(x){
var flag=false;
for(var i=0;i<b.length;i++){
if(b[i]==x)flag=true;
if(b[i]>x)break;
}
return flag;
}

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 c=[];

a.sort(function(a,b){return a-b;});
b.sort(function(a,b){return a-b;});

var cnt=0;
var ab=a[0];
for(var i=1;i<a.length;i++){
if(i!=0 && ab==a[i])continue;
if(indexB(a[i]))c.push(a[i]);
ab=a[i];
}

console.log(c.length);