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

namespace ConsoleApplication59
{
    class Program
    {
        static void Main()
        {
            Console.ReadLine();
            int[] A = Console.ReadLine().Split().Select(int.Parse).ToArray();
            Console.ReadLine();
            int[] B = Console.ReadLine().Split().Select(int.Parse).ToArray();
            int S = 0;
            for(int C = 0; C < B.Length; C++)
            {
                if (B[C] > A[A.Length / 2])
                {
                    for (int D = A.Length-1; D>-1; D--)
                    {
                        if (B[C] == A[D]) { S++; break; }
                    }
                }
                else
                {
                    for (int D = 0; D < A.Length; D++)
                    {
                        if (B[C] == A[D]) { S++; break; }
                    }
                }
            }
            Console.WriteLine(S);
        }
    }
}