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)

val1 = gets.chomp.to_i
array1 = gets.chomp.split(" ").map(&:to_i)
val2 = gets.chomp.to_i
array2 = gets.chomp.split(" ").map(&:to_i)

def solution(temp1, temp2)
  ans = 0

  temp1.each do |val|
    if temp2.include?(val)
      ans += 1
    end
  end

  if ans.to_i.zero?
    0
  else
    ans
  end
end

if array1.length < array2.length
  puts solution(array1, array2)
else
  puts solution(array2, array1)
end