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 binarySearch(key, arr)
  if arr.size == 0 then
    false
  elsif arr.size == 1 then
    arr[0].to_i == key.to_i
  else
    m = arr.size / 2
    v = arr[m].to_i

    if key.to_i == v then
      true
    elsif key.to_i < v then
      binarySearch(key, arr.take(m))
    else
      binarySearch(key, arr.drop(m))
    end
  end
end


a_size = STDIN.gets.to_i
as = STDIN.gets.split(' ')

b_size = STDIN.gets.to_i
bs = STDIN.gets.split(' ')

n = 0
for i in bs
  if binarySearch(i, as) then
    n = n + 1
  end
end

puts n