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 SearchII
  def solve
    n = gets.chomp.to_i
    s = gets.scan(/\d+/).map(&:to_i)
    q = gets.chomp.to_i
    t = gets.scan(/\d+/).map(&:to_i)

    t.sort!

    i = 0
    j = 0
    cnt = 0

    while ((i < s.length) && (j < t.length))
      if (s[i] == t[j])
        cnt += 1
        i += 1
        j += 1
      elsif (s[i] > t[j])
        j += 1
      else
        i += 1
      end
    end
    return cnt.to_s
  end
end

if $0 == __FILE__
  puts SearchII.new.solve
end