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: Time Limit Exceeded)

using System;

class ALDS1
{

    static void Main()
    {
        int a = int.Parse(Console.ReadLine());
        string str1 = Console.ReadLine();
        string[] x = new string[a];
        x = str1.Split(' ');
        int b = int.Parse(Console.ReadLine());
        string str2 = Console.ReadLine();
        string[] y = new string[b];
        y = str2.Split(' ');
        int cnt = 0;
        foreach (string z in y)
        {
            for (int i = 0; i < a; i++)
            {
                if (z == x[i])
                {
                    cnt++;
                    break;
                }
            }
        }
        Console.WriteLine(cnt);
    }

}