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)

size_A = gets.chomp.to_i
input_values_A = []

input_strings_A = gets.chomp.split
for i in 0..size_A-1
  input_value_A = input_strings_A[i].to_i
  input_values_A.push(input_value_A)
end


size_B = gets.chomp.to_i
input_values_B = []

input_strings_B = gets.chomp.split
for i in 0..size_B-1
  input_value_B = input_strings_B[i].to_i
  input_values_B.push(input_value_B)
end

duplicated_word_count = 0
for i in 0..size_A-1
  for j in 0..size_B-1
    if input_values_B[j]==input_values_A[i]
      duplicated_word_count += 1
    break
    end
  end
end
puts duplicated_word_count