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_binary_
{
    class Program
    {
        static void Main(string[] args)
        {
            Console.ReadLine();
            string[] S = getsplit();
            int[] s2 = Array.ConvertAll(S, int.Parse);            
            Console.ReadLine();
            string[] T = getsplit();
            int count=0;

            foreach (var t in T)
                if (BinarySearch(s2, getint(t)))
                    count++;

            Console.WriteLine(count);
        }

        public static string[] getsplit()
        {
            string[] x = Console.ReadLine().Split(' ');
            return x;
        }
        public static int getint(string a)
        {

            if (a == null || a.Length == 0)
            {
                int x = int.Parse(Console.ReadLine());
                return x;
            }
            else
            {
                int x = int.Parse(a);
                return x;
            }
        }

        static bool BinarySearch(int[] a,int key)
         {
            int left = 0;
            int right = a.Length;

            while (left<right)
            {
                int mid = (left + right) / 2;
                if (a[mid] == key)
                {
                    return true;
                }
                else if (key < a[mid])
                {
                    right = mid;
                }
                else
                {
                    left = mid + 1;
                }
            }
            return false;
         }
    }
}