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;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Text;

class Program
{
    static void Main(string[] args)
    {
        int N = int.Parse(Console.ReadLine());
        string[] s1 = Console.ReadLine().Split(' ');
        int q = int.Parse(Console.ReadLine());
        string[] s2 = Console.ReadLine().Split(' ');

        int[] a = new int[N];
        int[] b = new int[q];
        int cnt = 0;

        for (int i = 0; i < N; i++)
        {
            a[i] = int.Parse(s1[i]);
        }

		for (int i = 0; i < q; i++)
		{
			b[i] = int.Parse(s2[i]);
		}

        Array.Sort(a);

        for (int i = 0; i < q;i++)
        {
            if (Array.BinarySearch(a, b[i])>=0) cnt++;
        }


        Console.WriteLine(cnt);
    }
}