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 = gets.to_i
sArr = gets.chomp.split(' ').map(&:to_i)
q = gets.to_i
tArr = gets.chomp.split(' ').map(&:to_i)

ans = 0
tArr.each do |t|
    arr = sArr.dup
    while true do
        a = arr[arr.size / 2]
        if t == a then
            ans += 1
            break
        elsif t > a then
            if arr.size == 1 then
                break
            else
                arr = arr[arr.size / 2, arr.size]
            end
        else
            if arr.size == 1 then
                break
            else
                arr = arr[0, arr.size / 2]
            end
        end
    end
end

puts ans