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.*;
public class Main {
	public static void main(String args[]){
		Scanner sc =new Scanner(System.in);
		int n,q;
		n = sc.nextInt();
		int[] nums = new int[n];
		for(int i=0;i<n;i++){
			nums[i] = sc.nextInt();
		}
		q = sc.nextInt();
		int[] data = new int[q];
		for(int i=0;i<q;i++){
			data[i] = sc.nextInt();
		}
		Arrays.sort(nums);
		int ans =0;
		for(int i=0;i<q;i++){
			if(search(nums,data[i])){
				ans++;
			}
		}
		System.out.println(ans);
		
		
	}
	public static boolean search(int[] nums,int x){
		int l =0; 
		int r = nums.length-1;
		while(l<=r){
			int mid = l+(r-l)/2;
			if(nums[mid]==x){
				return true;
			}else if(nums[mid]>x){
				r =mid-1;
			}else{
				l =mid+1;
			}
		}
		return false;
	}
}