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)

n = gets(chomp:true).to_i
s = [*gets.split]
gets
t = [*gets.split]

c = 0 # Sの中でTが含まれるものの個数C

t.each do |t_value| # Tの配列の数だけ繰り返す
  i = 0 # 繰り返しのカウンタ
  s[n] = t_value # Sの配列の最後にTの配列取り出した要素(番兵)を入れる
  while s[i] != t_value # Sの配列の要素と取り出したTの配列の要素(key)が一致するまでループする
    i += 1 # Sの配列の要素と取り出したTの配列の要素(key)が一致しない間は繰り返しカウンタに1を加算し続ける
  end

  # 繰り返しカウンタがnと等しくなければ、最後の番兵にたどり着かずに値が一致した証拠であるためcに加算する
  c += 1 if i != n 
end

puts c