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;

class Search
{
    public bool BinarySeach(int[] a, int n, int key) {
        int left = 0, right = n;
        while (left < right) {
            int mid = (left + right) / 2;
            if (a[mid] == key) {
                return true;
            }
            if (a[mid] > key) {
                right = mid;
            } else {
                left = mid+1;
            }
        }
        return false;
    }
}

class A
{
    public static void Main() {
        int n, q, count = 0;
        int[] s;
        Search search = new Search();
        s = new int[100001];
        n = int.Parse(Console.ReadLine());
        string[] data = Console.ReadLine().Split(' ');
        for (int i = 0; i < n; i++) {
            s[i] = int.Parse(data[i]);
        }
        q = int.Parse(Console.ReadLine());
        string[] data2 = Console.ReadLine().Split(' ');
        for (int i = 0; i < q; i++) {
            if (search.BinarySeach(s, n, int.Parse(data2[i]))) {
                count++;
            }
        }
        Console.WriteLine(count);
    }
}