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.Arrays;
import java.util.Scanner;
import java.util.function.BinaryOperator;

import javax.rmi.ssl.SslRMIClientSocketFactory;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner scan=new Scanner(System.in);
		int cnt=0;
		int n=scan.nextInt();
		int[] arr1=new int[n];
		
		for(int i=0;i<n;i++){
			arr1[i]=scan.nextInt();
		}
		Arrays.sort(arr1);
		
		int m=scan.nextInt();
		for(int i=0;i<m;i++){
			int t=scan.nextInt();
			if(binary(arr1,t))
				cnt++;
		}
		
		System.out.println(cnt);
	}

	private static boolean binary(int[] arr, int key) {
		// TODO Auto-generated method stub
		int low=0,high=arr.length;
		
		while(low<=high){
			int mid=(low+high)/2;
			if(arr[mid]>key)
				high=mid-1;
			else if(arr[mid]<key)
				low=mid+1;
			else return true;
		}
		return false;
	}

}

