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)

import sys
import math
import copy
from typing import Tuple, List, Union
input = sys.stdin.readline


def binary_search(t, S):
    left = 0
    right = len (S)
    while left < right:
        mid = int ((left + right) / 2)
        if S [mid] == t:
            return True
        elif t < S[mid]:
            right = mid
        else:
            left = mid + 1
    return False


def main():
    n = int(input())
    S = tuple(map(int, input().split()))
    q = int(input())
    T = tuple(map(int, input().split()))
    return [binary_search(t, S) for t in T]



if __name__ == '__main__':
    print(sum(main()))