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.

Notes

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

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.

Examples

Input

5
1 2 3 4 5
3
3 4 1


Output

3


Input

3
1 2 3
1
5


Output

0


Input

5
1 1 2 2 3
2
1 2


Output

2
import java.util.Scanner;
 
 
 class Main{
 
   public static boolean search(int A[],int n,int key){
		
		int left =0;
		int mid;
		int right =n;
		
		while(left<right){
			mid=(left+right)/2;
			if(key==A[mid]) 
				return true; 
			if(key>A[mid])
				left=mid+1;
			else if(key<A[mid])
				right =mid;
		}
		return false;
	}

    public static void main(String[] args) {
        int A[]=new int[1000000];
        int i,j,n,q,key,sum=0;
         
        Scanner s =new Scanner(System.in);
        n=s.nextInt();
        for(i=0;i<n;i++){
            A[i]=s.nextInt();
        }
         
        q=s.nextInt();
        for(j=0;j<q;j++){
            key=s.nextInt();

            if(search(A,n,key))
                          sum++;
        }
      System.out.println(sum);
    }
 
}