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 C# (judge verdict: Accepted)

using System;
using System.Linq;
using System.Collections.Generic;

class Program{
    static long n;
    static long[] s;
    static long q;
    static long[] t;
    static void Main(){
        n = long.Parse(Console.ReadLine());
        s = Console.ReadLine().Split().Select(long.Parse).ToArray();
        q = long.Parse(Console.ReadLine());
        t = Console.ReadLine().Split().Select(long.Parse).ToArray();
        long count = 0;
        for(int i=0; i<q; i++){
            if(Check(t[i]))count++;
        }
        Console.WriteLine(count);
    }
    
    static bool Check(long l){
        //???????????????s????????????????????¢?´¢???????????????
        //????????¨?????????????°??????¨?????§???????????£???mid?????¨??£????????????
        long lb = 0, ub = n;
        while(lb<ub){
            var mid = (lb+ub)/2;
            if(s[mid]==l) return true;
            else if(l<s[mid]) ub = mid;
            else lb = mid+1;
        }
        return false;
    }
}