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 ALDS1_4_B_BinarySearch
{
	class Program
	{
		static void Main ( string[] args )
		{
			//input
			Console.ReadLine ();
			int[] searchArray = Console.ReadLine ().Split (' ').Select (int.Parse).ToArray ();

			Console.ReadLine ();
			int[] elementArray = Console.ReadLine ().Split (' ').Select (int.Parse).ToArray ();

			//process
			int count = 0;

			foreach (var item in elementArray)
			{
				bool isFind = BinarySearch (searchArray, item);

				if (isFind)
				{
					count++;
				}
			}

			Console.WriteLine (count);
		}

		static bool BinarySearch ( int[] numArray, int searchNum )
		{
			int lowerIndex = 0;
			int upperIndex = numArray.Length - 1;

			while (lowerIndex <= upperIndex)
			{
				int middleIndex = (lowerIndex + upperIndex) / 2;
				int item = numArray[middleIndex];

				bool isFind = item == searchNum;

				if (isFind)
				{
					return true;
				}
				else
				{
					if (item < searchNum)
					{
						lowerIndex = middleIndex + 1;
					}
					else
					{
						upperIndex = middleIndex - 1;
					}
				}
			}

			return false;
		}
	}
}