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 PGC
{
	class Program
	{
		static void Main(string[] args)
		{
			var n = int.Parse(Console.ReadLine());
			var S = Console.ReadLine().Split().Select(int.Parse).ToArray();

			var q = int.Parse(Console.ReadLine());
			var T = Console.ReadLine().Split().Select(int.Parse).ToArray();

			Array.Sort(S);
			Array.Sort(T);

			System.Console.WriteLine(T.Where(t => bin(S, t)).Count());
		}

		static bool bin(int[] array, int val)
		{
			var min = 0;
			var max = array.Length;
			var mid = (max + min) / 2;

			var isFound = false;
			while (min < max)
			{
				if (array[mid] == val)
				{
					isFound = true;
					break;
				}
				else if (array[mid] < val)
				{
					min = mid + 1;
				}
				else
				{
					max = mid;
				}
				mid = (max + min) / 2;
			}

			return isFound;
		}
	}
}