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{
	Scanner sc = new Scanner(System.in);
	int n;
	int[] S;
	int q;
	int[] T;
	int C;
	int left;
	int right;
	int mid;
	void n(){
		n=sc.nextInt();
		S=new int[n];
		for(int i=0; i<n; i++){
			S[i]=sc.nextInt();
		}
		q=sc.nextInt();
		T=new int[q];
		for(int j=0; j<q; j++){
			T[j]=sc.nextInt();
		}
		
		for(int j=0; j<q; j++){
			left=0;
			right=n;
			while(left<right){
				mid=(left+right)/2;
				
				if(T[j]==S[mid]){
					C++;
					break;
				}else if(T[j]<S[mid]){
					right=mid;
				}else if(T[j]>S[mid]){
					left=mid+1;
				}
			}
		}
		System.out.println(C);
	}
	public static void main(String[]agrs){
		new Main().n();
	}
}