Problem:
Search II

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

Elements in S is sorted in ascending order

n ≤ 100000

q ≤ 50000

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
1 2 3
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 = list(map(int, input().split()))
q = int(input())
t = list(map(int, input().split()))

# num: 検索対象の数字, items: 検索範囲
def binary_search(num, items):
    low = 0
    high = len(s) - 1
    while low <= high:
        mid = (low + high) // 2
        guess = items[mid]
        if guess == num:
            return True
        if guess > num:
            high = mid -1
        else:
            low = mid + 1
    return False

cnt = 0
for i in range(q):
    if binary_search(t[i], s):
        cnt += 1
print(cnt)