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 ALDS1_4_B
{
    class Program
    {
        static void Main(string[] args)
        {
            string input = Console.ReadLine();
            int N = int.Parse(input);
            input = Console.ReadLine();
            string[] ref_st = input.Split(' ');
            int[] reference = new int[N];

            for (int i = 0; i < N; i++)
            {
                reference[i] = int.Parse(ref_st[i]);
            }

            input = Console.ReadLine();
            int q = int.Parse(input);
            input = Console.ReadLine();
            string[] ana_st = input.Split(' ');
            int[] analyte = new int[q];

            for (int i = 0; i < q; i++)
            {
                analyte[i] = int.Parse(ana_st[i]);
            }

            int left, right, middle;
            int count = 0;

            for (int i = 0; i < q; i++)
            {
                left = 0; right = N; 

                while (left < right)
                {
                    middle = (left + right) / 2;
                    if (reference[middle] == analyte[i])
                    {
                        count++;
                        break;
                    } else
                    {
                        if (reference[middle] < analyte[i])
                        {
                            left = middle + 1;
                        } else
                        {
                            right = middle;
                        }
                    }
                }
            }

            Console.WriteLine(count);

            
        }
    }
}