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 sc = new Scanner(System.in);
		int ans = 0;

		int N = sc.nextInt();
		int[] S = new int[N];
		for(int i = 0; i < N; i++) {
			S[i] = sc.nextInt();
		}
		insertionSort(S, N);

		int Q = sc.nextInt();
		for(int i = 0; i < Q; i++) {
			int t = sc.nextInt();
			ans += binary_search(S, t, 0, N-1);
		}

		System.out.println(ans);
		sc.close();
	}

	// 見つかれば1、見つからなければ0
	public static int binary_search(int[] a, int x, int left, int right) {
		if(left > right) {
			return 0;
		}else {
			int mid = (left + right) / 2;
			if(a[mid] == x) {
				return 1;
			}else if(a[mid] < x) {
				return binary_search(a, x, mid+1, right);
			}else {
				return binary_search(a, x, left, mid-1);
			}
		}
	}

	// 挿入ソート
		static void insertionSort(int[] a, int n) {
			for(int i = 1; i < n; i++) {
				int v = a[i];   // 挿入する要素の保存
				int j = i - 1;
				while(j >= 0 && a[j] > v) {
					a[j + 1] = a[j];
					j--;
				}
				a[j + 1] = v;
			}
		}
}