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)

//線形探索//O(q log n)のアルゴリズム
using System;
using System.Linq;

namespace tst
{
    class Program
    {
        public static void Binary(ref int cnt, int n, int[]S, int key)
        {
            int left = 0;
            int right = n;
            while (left < right)
            {
                int mid = (left + right) / 2;
                if (S[mid] == key)
                {
                    cnt++;
                    break;
                }else if (key < S[mid])
                {
                    right = mid;
                }
                else
                {
                    left = mid+1;
                }
            }
        }
        public static void Main()
        {
            int n = int.Parse(Console.ReadLine());
            string text1 = Console.ReadLine();
            string[] SS = text1.Split(' ');
            int[] S = SS.Select(s => int.Parse(s)).ToArray();
            int q = int.Parse(Console.ReadLine());
            string text2 = Console.ReadLine();
            string[] TT = text2.Split(' ');
            int[] T = TT.Select(s => int.Parse(s)).ToArray();

            int cnt = 0;

            for(int i=0; i<q; i++)
            {
                Binary(ref cnt, n, S, T[i]);

            }

            Console.WriteLine(cnt);
        }

    }
}