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;

namespace Project
{
	class MainClass
	{
		public static void Main(string[] args)
		{
			int n = int.Parse(Console.ReadLine());
			string[] s = Console.ReadLine().Split(' ');
			int[] S = new int[n];
			for (int i = 0; i < n; i++)
			{
				S[i] = int.Parse(s[i]);
			}
			int q = int.Parse(Console.ReadLine());
			string[] t = Console.ReadLine().Split(' ');
			int[] T = new int[q];
			for (int i = 0; i < q; i++)
			{
				T[i] = int.Parse(t[i]);
			}
			int count = 0;
			int now;
			int first, last;
			for (int j = 0; j < q; j++)
			{
				first = 0;
				last = n - 1;
				while (first != last && first + 1 != last)
				{
					now = (last + first) / 2;

					if (S[now] == T[j] || S[first] == T[j] || S[last] == T[j])
					{
						count++;
						break;
					}
					if (S[now] > T[j])
					{
						last = now;
					}
					else if (S[now] < T[j])
					{
						first = now;
					}

				}
			}
			Console.WriteLine(count);
		}
	}
}