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;

namespace myApp
{
    class Program
    {
        static bool BinarySearch(int[] A, int n, int key) {
            int     left = 0;
            int     right = n;
            while (left < right) {
                int     mid = (left + right) / 2;
                if (A[mid] == key) {
                    return true;
                } else if (key < A[mid]) {
                    right = mid;
                } else if (A[mid] < key) {
                    left = mid + 1;
                }
            }

            // 見つからなかった
            return false;
        }

        static void Main(string[] args)
        {
            var n = int.Parse(Console.ReadLine());
            var S = Console.ReadLine().Split(' ').Select(str => int.Parse(str)).ToArray();

            var q = int.Parse(Console.ReadLine());
            var T = Console.ReadLine().Split(' ').Select(str => int.Parse(str)).ToArray();

            var sum = 0;
            for (int i = 0; i < q; i++) {
                if (BinarySearch(S, n, T[i])) sum++;
            }

            Console.WriteLine(sum);
        }
    }
}