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

class Program
{
    static void Main(string[] args) {
        int n = int.Parse(Console.ReadLine());
        List<int> s = Console.ReadLine().Split().Select(int.Parse).Distinct().ToList();
        n = s.Count();
        int q = int.Parse(Console.ReadLine());
        List<int> t = Console.ReadLine().Split().Select(int.Parse).ToList();
        s.Sort();
        int count = 0;
        for (int i = 0; i < q; i ++) {
            count += binarySearch(s,n,t[i]);
        }
        Console.WriteLine(count);
    }
    static int binarySearch(List<int> s, int n, int t) {
        int l = 0;
        int r = n;
        while(l < r) {
            int m = (l+r)/2;
            if (s[m]<t) l = m+1;
            else if (s[m]>t) r = m;
            else return 1;
        }
        return 0;
    }
}