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
# ALDS1 : Binary Search

def binary_search(S,t,imin,imax):
    if imin>imax:
        return 0
    else:
        imid = imin + (imax - imin)/2
        if S[imid] > t:
            return binary_search(S,t,imin,imid-1)
        elif S[imid]<t:
            return binary_search(S,t,imid+1,imax)
        else:
            return 1

def main():
    n = input()
    S = map(int,raw_input().split())
    q = input()
    T = map(int,raw_input().split())
    ans = 0
    for t in T:
        ans += binary_search(S,t,0,len(S))
    print ans

if __name__ == '__main__':
    main()