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 Main(input) {
  var data = input.split('\n');
  var sNum = parseInt(data.shift());
  var sArr = data.shift().split(' ');
  var tNum = parseInt(data.shift());
  var tArr = data.shift().split(' ');
  
  var start = 0, end = sArr.length - 1;
  var cnt = 0;
  tArr.forEach(function(t){
    while (start < end) {
      var idx = parseInt((end - start) / 2) + start;
      var sCenter = sArr[idx];
      if (t === sCenter) {
        cnt++;
        break;
      } else if (t < sCenter) {
        end = idx;
      } else {
        start = idx + 1;
      }
      
      if (start === end) {
        if (sArr[start] === t) {
          cnt++;
        }
      }
    }
  });
  console.log(cnt);
}

// Don't edit this line!
Main(require("fs").readFileSync("/dev/stdin", "utf8"));