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.Scanner;

public class Main {

	public static void main(String[] args) {
	
		Scanner in = new Scanner(System.in);
		int input = in.nextInt();
		int S[] = new int[input];
		
		for (int i = 0; i < input; i++)
			S[i] = in.nextInt();
			int nextInput = in.nextInt();
		
		int T[] = new int[nextInput];
		for (int i = 0; i < nextInput; i++)
			T[i] = in.nextInt();
		
		int C = 0;
		for (int i = 0; i < nextInput; i++) {	
			if (binarySearch(S, T[i]))	
				C++;		
		}
		
		System.out.println(C);
		
		}
		
		public static boolean binarySearch(int arr[], int param) {
		
			int left = 0; 
			int right = arr.length - 1;
			while (left <= right) {	
					int middle = (left + right) / 2;
					if (arr[middle] == param)
						return true;
					if (arr[middle] < param)
						left = middle + 1;
					else
						right = middle - 1;
		}
				return false;
	
	}
}