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: Time Limit Exceeded)

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		int C = 0;
		Scanner in = new Scanner(System.in);
		//??°???S?????????
		int n = in.nextInt();
		int[] S = new int[n];
		for(int i = 0;i<n;i++) S[i] = in.nextInt();
		//??°???T?????????
		int q = in.nextInt();
		int[] T = new int[q];
		for(int i = 0;i<q;i++) T[i] = in.nextInt();
		
		int lowerBound = 0;
		int upperBound = n-1;
		int curIn;
		for(int i = 0;i<q;i++){
			int searchkey = T[i];
			while(true){
				curIn = (lowerBound+upperBound)/2;
				if(S[curIn] == searchkey) {
					C++;
					break;
				}else if(lowerBound>upperBound) break;
				else{
					if(S[curIn]>searchkey)
						lowerBound = curIn +1;
					else
						upperBound = curIn +1;
				}
				
			}
		}
		System.out.println(C);
	}
}