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: Wrong Answer)




def linear_search(array, value)
  length = array.length
  i = 0
  while true
    array.push(value)
    if array[i] == value
      if i == length
        break
      else
        return true
      end
    else
      i += 1
    end
  end
  array.delete(-1)
end

  # for i in 0..(length-1)
  #   if array[i] != value
  #     count += 1
  #   elsif count == value
  #     break
  #   else
  #   return true
  #   end
#   end
# end

n = gets.chomp.to_i
s = gets.chomp.split.map(&:to_i)
q = gets.chomp.to_i
t = gets.chomp.split.map(&:to_i)

sum_count = -1
  for i in 0..(n-1)
    if linear_search(s, t[i]) == true
      sum_count += 1
    end
  end

puts sum_count