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 Aizu
{
	class Program
	{
		static void Main(string[] args)
		{
			var n = int.Parse(Console.ReadLine());
			var s = Console.ReadLine().Split(' ').Select(value => int.Parse(value)).ToList();
			var q = int.Parse(Console.ReadLine());
			var t = Console.ReadLine().Split(' ').Select(value => int.Parse(value)).ToList();

			var count = 0;
			foreach(var value in t)
			{
				var startIndex = 0;
				var endIndex = n - 1;

				while (startIndex <= endIndex)
				{
					var index = (startIndex + endIndex) / 2;

					if (s[index] == value)
					{
						count++;
						break;
					}
					else if(s[index] < value)
					{
						startIndex = index + 1;
					}
					else
					{
						endIndex = index - 1;
					}
				}
			}

			Console.WriteLine(count);
		}
	}
}