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.IO;
namespace aoj{
    class program{
     
    static void Main() {
		
		BinarySearch bs = new BinarySearch(
			int.Parse(Console.ReadLine()), Console.ReadLine());
		bs.getKey(int.Parse(Console.ReadLine()), Console.ReadLine());
		bs.bs();
		bs.show();
	    
    }
}
class BinarySearch{
	int[] list;
	int[] keyList;
	int count=0;
	public BinarySearch(int length,string rl){
		list = new int[length];
		string[] tmp = rl.Split(' ');
		for(int i=0; i<length; i++)
			list[i] = int.Parse(tmp[i]);
	}
	public void getKey(int length,string rl){
		keyList = new int[length];
		string[] tmp = rl.Split(' ');
		for(int i=0; i<length; i++)
			keyList[i] = int.Parse(tmp[i]);
	}
	public void bs(){
		foreach( int k in keyList)
			count += search(k);
	}
	int search(int key){
		int left = 0;
		int right = list.Length;
		while(left<right){
			int mid = (left+right)/2;
			if(key==list[mid])
				return 1;
			else if(key<list[mid])
				right=mid;
			else
				left=mid+1;
		}
		return 0;
	}
	public void show(){
		Console.WriteLine("{0}",count);
	}
}
		
}