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: Time Limit Exceeded)

n = gets.to_i
s = gets.split(" ").map &:to_i
q = gets
ta = gets.split(" ").map &:to_i

c = 0
ta.each { |t|
	s_start = 0
	s_end = n-1
	while true
		i = (s_start + s_end) / 2
		if t == s[i]
			c += 1
			break
		elsif t < s[i]
			s_end = i - 1
		elsif s[i] < t
			s_start = i + 1
		end
	end
}
puts c