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)

def binary_search(array, key)
    left = 0
    right = array.length
    while left < right
        mid = (left + right) / 2
        if array[mid] == key
            return mid
        elsif key < array[mid]
            right = mid
        else
            left = mid + 1
        end
    end
    return -1
end

line_count = gets.to_i
array = gets.split(" ").map(&:to_i)
search_count = gets.to_i
search_array = gets.split(" ").map(&:to_i)
puts search_array.count{|n| binary_search(array, n) > 0}