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: Wrong Answer)

using System;
using System.Linq;

public static class Program
{
    static int n;
    public static void Main(string[] args)
    {
      n = int.Parse(Console.ReadLine());
      int[] S = Console.ReadLine().Split(' ').Select(x => int.Parse(x)).ToArray();
      int q = int.Parse(Console.ReadLine());
      int[] T = Console.ReadLine().Split(' ').Select(x => int.Parse(x)).ToArray();

      int count = 0;
      for(int i = 0; i < q; i++)
      {
        if(Count(S, T[i]))
        {
          count++;
        }
      }

      Console.WriteLine(count);
    }

    public static bool Count(int[] S, int target)
    {
      int l = 0;
      int r = n - 1;

      while(l < r)
      {
        int mid = (l + r) / 2;
        if(S[mid] < target)
        {
          l = mid + 1;
        }
        else if(target < S[mid])
        {
          r = mid;
        }
        else
        {
          return true;
        }
      }

      return false;
    }
}