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.Linq;
using System.Collections.Generic;
using System;
 
    class Program
    {
    static bool BSI(int[] a,int k)
    {
    int min = 0;
    int max = a.Length - 1;
    while (!(max < min))
    {
    var m = min + (max - min) / 2;
    if (a[m] > k)
    {
    max = m - 1;
    continue;
    }
    else if (a[m] < k)
    {
    min = m + 1;
    }else
    return true;
    }
    
    
   return false;
    }
        static void Main(string[] args)
        {
    Console.ReadLine();
var S=    Console.ReadLine().Split(' ').Select(x => int.Parse(x)).ToArray();

    Console.ReadLine();
var T=    Console.ReadLine().Split(' ').Select(x => int.Parse(x)).ToArray();
int c = 0;
foreach (var s in T)
{
c += BSI(S,s) ? 1 : 0;
}
Console.WriteLine(c);
}
    }