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: Wrong Answer)

using System;
using System.Collections;
using System.Collections.Generic;
using System.Text;
using System.Linq;

class Program
{
	static void Main(string[] args)
	{
		Console.ReadLine();
		int[] S = Console.ReadLine().Split().Select(str => int.Parse(str)).ToArray();
		int q = int.Parse(Console.ReadLine().Split()[0]);
		int[] T = Console.ReadLine().Split().Select(str => int.Parse(str)).ToArray();

		int count = 0;

		for (int i = 0; i < q; i++)
		{
			if (Check(S, T[i]))
			{
				count++;
			}
		}

		System.Console.WriteLine(count);
	}

	static bool Check(int[] S, int query)
	{
		int first = 0;
		int last = S.Length - 1;
		while (first < last)
		{
			int pivot = (last + first) / 2;
			if (S[pivot] > query)
			{
				last = pivot - 1;
			}
			else if (S[pivot] < query)
			{
				first = pivot + 1;
			}
			else
			{
				return true;
			}
		}
		return false;
	}
}