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)

def main():
    import sys
    import math

    asa =  sys.stdin.readline
    n = int(input())
    s = list(map(int, asa().split()))
    q = int(input())
    t = list(map(int, asa().split()))
    c = 0

    stopper = math.log2(n) + 1

    for i in t: # tの中のiを探索vim
        time = 0
        middle = int(n/2)
        small = 0
        large = n
        time = 0

        while s[middle] != i and time < stopper:
            if s[middle] > i:
                large = middle
                middle = int((middle + small) / 2)

            else:
                small = middle
                middle = int((middle + large) / 2)

            time += 1
        if s[middle] == i:
            c += 1

    print(c)

if __name__ == '__main__':
    main()