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)

require 'set'

def main
  n = gets.chomp.to_i
  n_arr = gets.chomp.split(/\s/).collect { |x| x.to_i}
  q = gets.chomp.to_i
  q_arr = gets.chomp.split(/\s/).collect { |x| x.to_i}

  s1, s2 = Set.new, Set.new
  n_arr.each { |elem| s1 << elem}
  q_arr.each { |elem| s2 << elem}

  puts (s1 & s2).size
end

main