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;

namespace aoj
{
    class Program
    {
        static void Main(string[] args)
        {
            var sNum = int.Parse(Console.ReadLine());
            int[] S = Console.ReadLine().Split(' ').Select(x => int.Parse(x)).ToArray();
            var qNum = int.Parse(Console.ReadLine());
            int[] Q = Console.ReadLine().Split(' ').Select(x => int.Parse(x)).ToArray();

            InsertSort(ref S);
            InsertSort(ref Q);

            var count = 0;

            var prevTarget = 0;
            for (var qi = 0; qi < Q.Length; ++qi)
            {
                // 検索のダブりを排除
                if (qi < 0 && prevTarget == Q[qi]) { continue; }

                if (BinarySearch(S, Q[qi]) != -1) { ++count; }

                prevTarget = Q[qi];
            }

            Console.WriteLine(count);
        }

        static int BinarySearch(int[] _searched, int _target)
        {
            var left = 0;
            var right = _searched.Length;
            int middle = -1;

            while (left < right)
            {
                middle = (left + right) / 2;

                if (_searched[middle] == _target)
                {
                    while (0 <= middle - 1)
                    {
                        if (_searched[middle - 1] != _searched[middle]) { break; }
                        --middle;
                    }
                    return middle;
                }

                if (_searched[middle] < _target)
                {
                    left = middle + 1;
                }
                else
                {
                    right = middle;
                }
            }

            return -1;
        }

        static void InsertSort(ref int[] _array)
        {
            for (var i = 1; i < _array.Length; ++i)
            {
                var target = _array[i];
                var compIndex = i - 1;

                while (0 <= compIndex && target < _array[compIndex])
                {
                    _array[compIndex + 1] = _array[compIndex];
                    --compIndex;
                }

                _array[compIndex + 1] = target;
            }
        }
    }
}