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 bsearch(a, c)
  return false if a.empty? || a.nil?

  len = a.length
  if len == 1
    a[0] == c
  else
    mid = len/2
    case
    when a[mid] == c
      true
    when a[mid] > c
      bsearch(a[0..(mid-1)], c)
    when a[mid] < c
      bsearch(a[(mid+1)..-1], c)
    end
  end
end

gets
s = gets.split.map(&:to_i)
gets
t = gets.split.map(&:to_i)
sum = 0
t.each do |c|
  sum += 1 if bsearch(s, c)
end
puts sum