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;

public class BinarySearch
{
    public static void Main()
    {
        Console.ReadLine();
        var s = Console.ReadLine().Split(' ').Select(int.Parse).ToArray();
        Console.ReadLine();
        var t = Console.ReadLine().Split(' ').Select(int.Parse).ToArray();
    
//        "SearchWithHashSet".Measure(() => 
//        {
//            SearchWithHashSet(s, t);
//        });
//        "SearchWithBinarySearch".Measure(() => 
//        {
            SearchWithBinarySearch(s, t);
//        });
    }
    
    private static void SearchWithHashSet(int[] s, int[] t)
    {
//        ThreadPool.SetMinThreads(32, 32);
        var hashSet = new HashSet<int>(s);
        var c = t.Count(x => hashSet.Contains(x));
        Console.WriteLine(c);
    }
    
    private static void SearchWithBinarySearch(int[] s, int[] t)
    {
        var c = t.Count(x => BinarySearchCore(s, x) > 0);
        Console.WriteLine(c);
    }
    
    private static int BinarySearchCore(int[] s, int key)
    {
        var left = 0;
        var right = s.Count();
        
        while (left < right)
        {
            var mid = (left + right) / 2;
            if (s[mid] == key)
                return mid;
            if (key < s[mid])
                right = mid;
            else
                left = mid + 1;
        }
        
        return -1;
    }
    
}
// Define other methods and classes here