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

public class Main {

	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		int n=Integer.parseInt(br.readLine());
        String[] str=br.readLine().split(" ");
        int[] S=new int[n];
        
        for(int i=0;i<n;i++)
            S[i]=Integer.parseInt(str[i]);
         
        int q=Integer.parseInt(br.readLine());
        str=br.readLine().split(" ");
        boolean con;
        int count=0;
        for(int i=0;i<q;i++)
            {con=false;
        	con=method(S,Integer.parseInt(str[i]));
            if(con)count++;}
        System.out.println(count);
         
        
         
 
    }
    static boolean method(int[] s,int t){
                        
        int count=0;
        int q=s.length/4;
        
        	if(t>s[q*2]){
        		if(t>s[q*3]){
            		for(int j=s[q*3];j<s.length;j++)
            			if(t==s[j]){count++;break;}}
            	else if(t<s[q*3]){
            		for(int j=q*2;j<q*3;j++)if(t==s[j]){count++;break;}}
            	else if(s[q*3]==t){count++;}}
        	
        	else if(t<s[q*2]){
        		if(t>s[q]){
            		for(int j=s[q+1];j<q*2;j++)
            			if(t==s[j]){count++;break;}}
            	else if(t<s[q]){
            		for(int j=0;j<q;j++)if(t==s[j]){count++;break;}}
            	else if(s[q]==t){count++;}}
        	
        		
        	else if(s[s.length/2]==t){count++;}
        		
        	
        
        
                 
        return count==1;
    }
 
}