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;

namespace Test
{
    class MainClass
    {
        public static void Main(string[] args)
        {
            Console.ReadLine();
            var numsS = Array.ConvertAll(Console.ReadLine().TrimEnd().Split(), int.Parse);
            Console.ReadLine();
            var numsT = Array.ConvertAll(Console.ReadLine().TrimEnd().Split(), int.Parse);
            int ans = 0;

            for (int i = 0; i < numsT.Length; i++)
            {
                var right = numsS.Length;
                var left = 0;
                var mid = numsS.Length / 2;

                while (left < right)
                {
                    if (numsT[i] < numsS[mid])
                    {
                        right = mid;
                        mid = (right - left) / 2 + left;
                    }
                    else if (numsT[i] > numsS[mid])
                    {
                        left = mid + 1;
                        mid = (right - left) / 2 + left;
                    }
                    else
                    {
                        ans++;
                        break;
                    }
                }
            }

            Console.WriteLine(ans);
        }
    }
}