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;
import java.util.Random;
import java.io.*;

public class Main {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		
		int length1 = scanner.nextInt();
		int[] arr1 = new int[length1];
		
		for(int i=0;i<length1; i++) {
			arr1[i] = scanner.nextInt();
		}
		
		int length2 = scanner.nextInt();
		int[] arr2 = new int[length2];
		
		for(int i=0;i<length2; i++) {
			arr2[i] = scanner.nextInt();
		}
		//Binary Search
		int count = 0;
		for(int i=0; i<length2; i++) {
			int left = 0;
			int right = length1 -1;
			
			Boolean cont = true;
			while(left <= right && cont == true) {
				int mid = (left +right)/2;
				
				if(arr2[i]==arr1[mid]) {
					count++;
					cont = false;}
				if(arr2[i] > arr1[mid])
					left = mid + 1;
				if(arr2[i] < arr1[mid])
					right = mid - 1;
			}
			
		}
		System.out.println(count);
		
	}
}
