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;

namespace ALDS1_4_B {
    public static class MyExtension {
        public static bool Contains(this int[] nums,int n) {
            int left = 0;
            int right = nums.Length;
            while (left < right) {
                int mid = (left + right) / 2;
                if (n == nums[mid])
                    return true;
                if (n > nums[mid])
                    left = mid + 1;
                else
                    right = mid;
            }
            return false;
        }
    }

    class Program {
        static void Main(string[] args) {
            Console.ReadLine();
            int[] S = Console.ReadLine().Split(' ').Select(int.Parse).ToArray();
            Console.ReadLine();
            int[] T = Console.ReadLine().Split(' ').Select(int.Parse).ToArray();
            int count = 0;
            foreach (int t in T) {
                if (S.Contains(t))
                    count++;
            }
            Console.WriteLine(count);
        }
    }
}