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)

n = gets.chomp.to_i
s = gets.split(" ").map{|x| x.to_i}
q = gets.chomp.to_i
t = gets.split(" ").map{|x| x.to_i}
count = 0
pos = 0
t.sort!
lim = t.size
s.each do |num|
  if  nil == t[pos]
    break
  end
  if num == t[pos]
    pos+=1
    count+=1
    redo
  elsif num < t[pos]  
    next
  else
    pos+=1
    redo
  end
end
p count