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 Python3 (judge verdict: Accepted)

n=int(input())
s=[]
x=input().strip().split()
for i in range(n):
	s.append(int(x[i]))
q=int(input())
t=[]
y=input().strip().split()
for j in range(q):
	t.append(int(y[j]))
	
if n<q:
	tmp=s
	s=t
	t=tmp
	
count=0

for i in range(len(t)):
	for j in range(len(s)):
		if t[i]==s[j]:
			count+=1
			break

print(count)