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.*;
//import static java.util.Arrays.*;
//import static java.util.Collections.*;
//import static java.lang.Math.*;

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO ?????????????????????????????????????????????
        int a,b,c,n,i,q,j,k;
        k=0;
        Scanner scan=new Scanner(System.in);
        n=scan.nextInt();
        int s[]=new int [n];
        for(i=0;i<n;i++)
        {
        	s[i]=scan.nextInt();
        }
        q=scan.nextInt();
        int t[]=new int [q];
        for(j=0;j<q;j++)
        {
        	t[j]=scan.nextInt();
        }
        for(j=0;j<q;j++)
        {
        a=0;
        b=n;
        while(a<b)
        {
        	c=(a+b)/2;
        	if(s[c]==t[j])
        	{
        		k++;
        		a=b+1;
        	}
        	else if(s[c]>t[j])
        	{
        		b=c;
        	}
        	else
        	{
        		a=c+1;
        	}
        }
        }
        System.out.println(k);
	}

}