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.

Notes

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

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.

Examples

Input

5
1 2 3 4 5
3
3 4 1


Output

3


Input

3
1 2 3
1
5


Output

0


Input

5
1 1 2 2 3
2
1 2


Output

2
n=int(raw_input())
s=(raw_input()).split(" ")
q=int(raw_input())
t=(raw_input()).split(" ")

for i in range(n):
    s[i]=int(s[i])
for i in range(q):
    t[i]=int(t[i])
t=sorted(t)

#print(s)
#print(t)

s_index=0

rt=0

for i in range(q):
    while s[s_index]<=t[i]:
        #print("s_index="+str(s_index)+" s[s_index]="+str(s[s_index]))
        #print("i="+str(i)+" t[i]="+str(t[i]))
        #print("rt="+str(rt))
        #print(" ")
        if s[s_index]==t[i]:
            rt+=1
            break
        s_index+=1
        if s_index>=n:
            break
        
    if s_index>=n:
            break

print(rt)