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;


public class Main{

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