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 Ruby (judge verdict: Accepted)

anum = gets.chomp.to_i
arr = gets.chomp.split.map(&:to_i)[0..anum]
tnum = gets.chomp.to_i
tarr = gets.chomp.split.map(&:to_i)[0..tnum]
cnt = 0
tarr.each do |item|
  sidx = 0
  eidx = arr.length 
  while sidx + 1< eidx
    idx = sidx + (eidx - sidx) / 2 
    if item == arr[idx]
      cnt += 1
      break
    end
    sidx = idx  if item > arr[idx]
    eidx = idx  if item < arr[idx]
  end
end

puts cnt