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()))

def func(x,btm,top):
  while btm < top:
    ctr = btm + (top-btm)//2 #中央値の添え字
    if x == S[ctr]:
      return 1
    elif x < S[ctr]:
      top = ctr
    elif x > S[ctr]:
      btm = ctr + 1
  return 0

C = 0
btm = 0
top = n
for i in T:
  C += func(i,btm,top)

print(C)