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;
using System.Collections.Generic;
using static System.Console;
using System.Text;
using System.IO;

namespace AOJ
{
    class Program
    {
        static public int[] Sarray() { return ReadLine().Split().Select(int.Parse).ToArray(); }
        static public List<int> Slist() { return ReadLine().Split().Select(int.Parse).ToList(); }
        static void Main(string[] args)
        {
            var N = Sarray()[0];
            var Si = Sarray();
            var Q = Sarray()[0];
            var Ti = Sarray();
            var cnt = 0;
            for (var i = 0; i < Q; ++i)
            {
                if (Ti[i] == Si[binaryserch(Si, Ti[i])]) 
                    ++cnt;
            }
            WriteLine(cnt);
        }
        static public int binaryserch(int[] ai, int vl)
        {
            var b = 0;
            var e = ai.Length - 1;
            var mid = 0;
            while (b <= e)
            {
                mid = b + (e - b) / 2;
                if (ai[mid] == vl)
                { break; }
                if (vl < ai[mid])
                {
                    e = mid - 1;
                    continue;
                }
                b = mid + 1;
            }
            return mid;
        }
    }
}