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.*;
import java.io.*;
class Main{
    public static void main(String args[]){
	int r,l,m,n,q,i,j,count=0;
	int s[] = new int[1000000];
	int t[] = new int[1000000];
	Scanner scan = new Scanner(System.in);
	
	n = scan.nextInt();
	for(i=0;i<n;i++){
	    s[i] = scan.nextInt();
	}
	q = scan.nextInt();
	for(j=0;j<q;j++){
	    t[j] = scan.nextInt();
	}
	
	for(j=0;j<q;j++){
	    r = n;
	    l = 0;
	    m = n/2;
	    while(true){
		if(s[m]==t[j]){count++;break;}
		if(m==l){break;} 
		if(s[m]>t[j]){/*探す値が左側にあった場合*/
		    r = m;
		    m = (r+l)/2;
		}
		if(s[m]<t[j]){/*探す値が右側にあった場合*/
		    l = m+1;
		    m = (r+l)/2;
		}
		}
	}
	System.out.println(count);
    }
}