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: Time Limit Exceeded)

const input = require('fs').readFileSync('/dev/stdin', 'utf8');

const list = input.trim().split('\n');
const n = Number(list[0]);
const S = list[1].split(' ').map(Number);
const q = Number(list[2]);
const T = list[3].split(' ').map(Number);

const search = (target, value) => {
  let l = 0;
  let r = target.length;
  while (l < r) {
    const index = Math.floor((l + r) / 2);
    if (target[index] < value) {
      l = index;
    } else if (target[index] > value) {
      r = index;
    } else {
      return true;
    }
  }
  return false;
}

let count = 0;
T.forEach((t) => {
  if (search(S, t)) {
    count++;
  }
});
console.log(count);