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 binarySearch left, right, arr, val
	mid = left + (right - left) / 2
	return true if arr[mid] == val

	if arr[mid] > val
		right = mid - 1
	else
		left = mid + 1
	end

	return false if left > right
	binarySearch(left, right, arr, val)
end

n = gets.to_i
s  = gets.chomp.split.map(&:to_i)
q = gets.to_i
t  = gets.chomp.split.map(&:to_i)

c = 0
t.each{|val| c += 1 if binarySearch(0, n - 1, s, val)}
puts c