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: Time Limit Exceeded)

n = STDIN.gets.to_i
S = STDIN.gets.split(' ')
q = STDIN.gets.to_i
T = STDIN.gets.split(' ')

found_count = 0
T.each do |t|
  current = n/2
  prev = n
  until current == prev
    prev = current
    if S[current]==t
      found_count += 1
      break
    elsif S[current] > t
      current /= 2
    else
      current = current + (n-current)/2
    end
  end
end

print "#{found_count}\n"