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)

class Array
  # k <= self[i]である最小のiを求める
  # 存在しない場合はi=n
  # (lo, hi]
  def lower_bound(k)
    lo = -1
    hi = size
    while hi - lo > 1
      mid = (lo + hi) / 2
      k <= at(mid) ? hi = mid : lo = mid
    end
    return hi
  end

  # k < self[i]である最小のiを求める
  # 存在しない場合はi=n
  # (lo, hi]
  def upper_bound(k)
    lo = -1
    hi = size
    while hi - lo > 1
      mid = (lo + hi) / 2
      k < at(mid) ? hi = mid : lo = mid
    end
    return hi
  end
end

n = gets.to_i
a = gets.split.map &:to_i
m = gets.to_i
b = gets.split.map &:to_i

ans = 0
b.each do |b|
  i = a.lower_bound(b)
  ans += 1 if i < n && a[i] == b
end
puts ans