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

namespace Test
{
    class Program
    {
        static void Main(string[] args)
        {
            int n = int.Parse(Console.ReadLine());
            string[] s = Console.ReadLine().Split(' ');
            int[] S = new int[n];
            int q = int.Parse(Console.ReadLine());
            string[] t = Console.ReadLine().Split(' ');
            int[] T = new int[q];
            Array.Sort(T);
            for (int i = 0; i < n; i++)
            {
                S[i] = int.Parse(s[i]);
            }
            for (int i = 0; i < q; i++)
            {
                T[i] = int.Parse(t[i]);
            }
            int count = 0;
            int now = 0;
            for (int j = 0; j < q; j++)
            {
                for (int i = 0; i < n; i++)
                {
                    if (S[i] == T[j])
                    {
                        count++;
                        now = i;
                        break;
                    }
                    if (S[i] < T[j])
                    {
                        now = i;
                        break;
                    }
                    if (i == n - 1)
                    {
                        now = q - 1;
                    }
                }
                if (now == q - 1)
                    break;
            }
            Console.WriteLine(count);
        }
    }
}