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;
using System.Collections.Generic;

class Program
{
    static int BinarySearch(long[] a, long key)
    {
        int left = 0, right = a.Length;
        while (left < right)
        {
            int mid = (left + right) / 2;
            if (a[mid] == key) return mid;
            if (a[mid] < key) left = mid + 1;
            if (a[mid] > key) right = mid;
        }
        return -1;
    }
    public static void Main(string[] args)
    {
        int n = int.Parse(Console.ReadLine());
        long[] ns = Console.ReadLine().Split(' ').Select(x => long.Parse(x)).ToArray();
        int q = int.Parse(Console.ReadLine());
        long[] qs = Console.ReadLine().Split(' ').Select(x => long.Parse(x)).ToArray();
        int res = 0;
        for (int i = 0; i < q; i++) res = (BinarySearch(ns, qs[i]) != -1)? res + 1: res;
        Console.WriteLine(res); 
    }
}