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

n = gets.chomp.to_i
S = gets.chomp.split(" ").map(&:to_i)
q = gets.chomp.to_i
T = gets.chomp.split(" ").map(&:to_i)
sortS = S.sort{|a, b| a <=> b}

count = 0

T.each do |t|
  left = 0
  right = n
  loop do
    middle = (right+left) / 2
    break if right == left
    if t == sortS[middle]
      count += 1
      break
    elsif sortS[middle] < t
      left = middle + 1
    else t <sortS[middle]
      right = middle -1
    end
  end
end

puts count