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)

def binary_search array, key
  #puts "#{key} in #{array.join ','}?"
  pivot = array.size / 2
  targets = array.dup
  loop do
    # ??????????????????????????????
    #sleep 0.1
    #puts "#{targets.join(',')} ??? #{pivot}????????? #{targets[pivot]}"
    if targets.size == 1 && targets[0] != key
      return nil
    elsif targets[pivot].nil?
      return nil
    elsif targets[pivot] == key
      # bingo
      return pivot
    elsif targets[pivot] > key
      #pivot?????????????????????
      targets = targets[0..(pivot - 1)]
      pivot = targets.size / 2
    elsif targets[pivot] < key
      targets = targets[(pivot + 1)..targets.size]
      pivot = targets.size / 2
    else
      return nil
    end
  end
end

def main size, array, keys_size, keys
  puts keys.select{|key|
    binary_search array, key
  }.size

end

size, array, keys_size, keys = STDIN.read.split(/\n/)
array = array.split(' ').map{|n|n.to_i}
keys = keys.split(' ').map{|n|n.to_i}

main(size, array, keys_size, keys)