Problem:
Search I

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

n ≤ 10000

q ≤ 500

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
3 1 2
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 SearchEqual(s, t)
	matched = []
	for i in 0..s.length-1
		for j in 0..t.length-1
			if s[i] == t[j]
				matched << t[j]
			end
		end
	end
	matched = matched.uniq
	p matched.length
end

#input sequence of numbers S
n = gets.chomp
n = gets.chomp
n = n.split()
#input of sequence of numbers T
q = gets.chomp
q = gets.chomp
q = q.split()
#output
SearchEqual(n, q);