Problem:
Search I

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

n ≤ 10000

q ≤ 500

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
3 1 2
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)

def include?(arr, n)
  if arr.length == 1
    return arr[0] == n
  else
    if arr[arr.length / 2] <= n
      return include?(arr[arr.length / 2..arr.length - 1], n)
    else
      return include?(arr[0...arr.length / 2], n)
    end
  end
end
gets
arr = gets.split(" ").map(&:to_i).sort
gets
count = 0
gets.split(" ").map(&:to_i).each{|item|
  count += 1 if include?(arr, item)
}
puts count