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


public class Main{

	public static void main(String args[]){
		int i,j,n;;
		Scanner sc=new Scanner(System.in);
		n=Integer.parseInt(sc.next());
		int s[]=new int[n+1];
		for(i=0;i<n;i++){
			s[i]=Integer.parseInt(sc.next());
			
		}
		
		
		int q=Integer.parseInt(sc.next());
		int t[]=new int[q+1];
		for(i=0;i<q;i++){
			t[i]=Integer.parseInt(sc.next());
		}
		
		int count=0;
		for(i=0;i<q;i++){
			if(s[n/2]<t[i]){
				for(j=(n/2)+1;j<n;j++){
					
					if(s[j]==t[i]){
						count++;
						break;
					}
				}
			}
			else{
				for(j=0;j<(n/2)+1;j++){
					
					if(s[j]==t[i]){
						count++;
						break;
					}
				}
			}
		}
		
		System.out.println(count);
		
		
		
		
		
		
	}
}