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


def bin_search(arr, x):
    n = len(arr)
    left = 0
    right = n
    while left < right:
        m = (left + right) / 2
        key = arr[m]
        if key == x:
            return True

        if x < key:
            right = m
        elif x > key:
            left = m + 1

    return False


def solve():
    num_s = int(raw_input())
    s = map(int, raw_input().split(" "))
    num_t = int(raw_input())
    t = map(int, raw_input().split(" "))

    count = 0
    for x in t:
        if bin_search(s, x):
            count += 1

    print count


if __name__ == "__main__":
    solve()