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 scan = new Scanner(System.in);
		int n = scan.nextInt();
		int []S = new int[n + 1];
		for(int i = 0; i < n; i++) {
			S[i] = scan.nextInt();
		}
		int q = scan.nextInt();
		int []T = new int[q];
		for(int i = 0; i < q; i++) {
			T[i] = scan.nextInt();
		}
		scan.close();
		int sum = 0;
		for(int i = 0; i < q; i++) {
			if(binarySearch(S, n, T[i]) == 1) {
				sum ++;
			}
		}
		System.out.println(sum);
	}
	public static int binarySearch(int[] A, int n, int key) {
		int left = 0;
		int right = n;
		int mid;
		while(left < right) {
			mid = (left + right) / 2;
			if(key == A[mid]) {
				return 1;
			}
			if(key > A[mid]) {
				left = mid + 1;
			}else if(key < A[mid]){
				right = mid;
			}
		}
		return 0;
	}
}