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: Wrong Answer)

import java.util.Scanner;

class Solve{
	public int s[];
	public int t[];
	public int count;
	public void binary(int left,int right,int num){
		int mid = (left + right) / 2;
		if(right - left <= 1) {
			if(right == num || left == num) count++;
		}
		else if(s[mid] == num) count++;
		else if(s[mid] < num) binary(mid,right,num);
		else binary(left,mid,num);
	}
}

class Main{
	public static void main(String[] args) 	{
		Scanner sc = new Scanner(System.in);
		Solve sv = new Solve();
		//prepare s
		int n = sc.nextInt();
		sv.s = new int[n];
		for(int i = 0;i < n;i++) {
			sv.s[i] = sc.nextInt();
		}
		//prepare t
		int q = sc.nextInt();
		sv.t = new int[q];
		for(int i = 0;i < q;i++) {
			sv.t[i] = sc.nextInt();
		}
		//find and count
		sv.count = 0;
		for(int i = 0;i < q;i++) {
			sv.binary(0,n - 1,sv.t[i]);
		}
		//print
		System.out.printf("%d\n",sv.count);
		sc.close();
	}
}