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

class Main{
	
	int n, q;int count=0;int j, L, R, mid;
	int[] S ;int[] T;
	Scanner sc = new Scanner(System.in);
	
	void input(){
		n = sc.nextInt();
		S = new int[n];
		for(int i=0; i<n; i++)S[i] = sc.nextInt();
		q = sc.nextInt();
		T = new int[q];
		for(int j=0; j<q; j++)T[j] = sc.nextInt();
		search();
		output();
	}
	void search(){
		for(j=0; j<q; j++){
			L=0; R=n;
			midd();
		}
	}
	void midd(){
		while(L!=R){
			mid=(L+R)/2;
			if(S[mid]==T[j]){
				count++;
				L=R;
			}else{
				if(S[mid]>T[j]){
					R=mid;
				}else{
					L=mid+1;
				}
			}
		}
	}

	void output(){
		System.out.println(count);
	}
	
	public static void main(String[] args){
		new Main().input();
	}
}