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
input()
slist = map(int, raw_input().split())
input()
tlist = map(int, raw_input().split())

def func(v, low, high):

    # print "l h = %d %d" % (low, high)
    if low > high:
        return 0

    mid = (low + high)/2
    
    # print "mid %d" % mid
    
    if mid >= len(slist):
        # print "test1"
        return 0
    
    if v > slist[mid]:
        if low == high:
            # print "test2"
            return 0
        # print "test3"
        return func(v, mid+1, high)
        
    elif v == slist[mid]:
        # print "test4"
        return 1
    else:
        if low == high:
            # print "test5"
            return 0

        # print "test6 %d %d" % (v, slist[mid])
        return func(v, low, mid-1)

count = 0
for t in tlist:
    count += func(t, 0, len(slist)-1)
print count