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.to_i
S = gets.split(" ").map(&:to_i)
q = gets.to_i
T = gets.split(" ").map(&:to_i)
@count = 0

def binary_search(arr,n, target)
  left = 0
  right = n
  while(left < right)
    md = (left + right) / 2
    if(arr[md] == target)
      @count += 1
      return
    elsif arr[md] < target
      left = md + 1
    else
      right = md
    end
  end
end

T.each do |target|
  binary_search(S.dup, n, target)
end

puts @count