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.Linq;

namespace aoj_ALDS1_4_B
{
    class MainClass
    {
        public static void Main(string[] args)
        {
			int couny_S = int.Parse(Console.ReadLine());
            int[] S = Console.ReadLine().Split(' ').Select(item => int.Parse(item)).ToArray();

            int couny_T = int.Parse(Console.ReadLine());
			int[] T = Console.ReadLine().Split(' ').Select(item => int.Parse(item)).ToArray();

            int matchCount = 0;
            foreach (var number in T)
			{
				int startIndex = 0;
				int endIndex = S.Length - 1;
				while (true)
				{
					int searchIndex = (startIndex + endIndex) / 2;
					if (number == S[searchIndex])
					{
						matchCount++;
						break;
					}
					else if (number < S[searchIndex])
					{
						endIndex = searchIndex - 1;
					}
					else if (number > S[searchIndex])
					{
						startIndex = searchIndex + 1;
					}

                    if (startIndex > endIndex)
					{
						break;
					}
				}
			}

            Console.WriteLine(matchCount);
        }
    }
}