Problem:
Search II

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

Elements in S is sorted in ascending order

n ≤ 100000

q ≤ 50000

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
1 2 3
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,), s, (q,), t = $<.map {|s| s.split.map &:to_i }
s.sort!

# p t.count {|y| s.bsearch {|x| y <=> x } }

p t.count {|y|
  l, u = 0, n
  while l < u
    m = (l + u) / 2
    case y <=> s[m]
    when -1 then u = m
    when  0 then l = u = m
    when  1 then l = m + 1
    end
  end
  y == s[l]
}