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.Collections;
using System.Collections.Generic;
using System.Text;
using System.IO;
using System.Linq;
using System.Diagnostics;
using System.Globalization;


namespace templete
{
    class BinarySearch
    {
        static void Main(string[] args)
        {
            Console.ReadLine();
            int[] num_n = Console.ReadLine().Split().Select(int.Parse).ToArray();

            int q = int.Parse(Console.ReadLine());
            int[] num_q = Console.ReadLine().Split().Select(int.Parse).ToArray();

            int count=0;
            for(int i=0; i<q; i++){
                int key = num_q[i];
                if(Search(num_n,key) != -1)count++;
            }
            Console.WriteLine(count);
        }

        static int Search(int[] num, int key){
            int left=0;
            int right=num.Length;

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