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 JAVA (judge verdict: Accepted)

import java.util.*;

public class Main {
	
	public static int totalMatches(int[] array, int[] array2) {
		int total=0;
		for (int i = 0; i < array2.length; i++) {
			if (Binarysearch(array, array2[i])) {
				total++;
			}
		}
		return total;
	}
	
	public static boolean Binarysearch( int[] array,  int search) {
		int left = 0;
		int right = array.length - 1;
		
		while ( left <= right) {
			int mid = (right+left)/2;
			if(array[mid] < search) {
				left = mid + 1;
			}
			else if(array[mid] > search) {
				right = mid - 1;
			}
			else {
				return true;
			}
		}
		return false;
		
	}
	
	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
		
		int sizearray = input.nextInt();

		int array[] = new int[sizearray];

		for (int i = 0; i < sizearray; i++) {
			array[i] = input.nextInt();

		}
		
		int sizearray2 = input.nextInt();
		int array2[] = new int[sizearray2];
		for (int i = 0; i < sizearray2; i++) {
			array2[i] = input.nextInt();

		}
		System.out.println(totalMatches(array, array2));
		
		input.close();
	}
	
}