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)

// Binary_Search.cs

using System;
using System.Collections.Generic;

class Binary_Search {
	public static void Main() {

		int n = int.Parse(Console.ReadLine());
		int[] s = new int[n];
		string str = Console.ReadLine();
		string[] num = str.Split();

		for(int i = 0; i < n; i++) {
			s[i] = int.Parse(num[i]);
		}

		int m = int.Parse(Console.ReadLine());
		string str_s = Console.ReadLine();
		string[] num_s = str_s.Split();
		int[] search = new int[m];
		for(int i = 0; i < m; i++) {
			search[i] = int.Parse(num_s[i]);
		}

		int count = 0;

		for(int i = 0; i < m; i++) {
			int r = n, mid, l = 0;
			mid = (r + l) / 2;
			while(l < r) {
				mid = (r + l) / 2;
				if(s[mid] == search[i]) {
					count++;
				//	Console.WriteLine("OK");
					break;
				} else if(s[mid] < search[i]) {
					l = mid + 1;
				} else {
					r = mid;
				}
			}
		}

		Console.WriteLine(count);

	}
}