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) {
		
		
		Scanner in = new Scanner(System.in);
		
		int n = in.nextInt();
		int [] arr = new int [n];
		
		for(int i = 0; i < n; i++) {
			arr[i] = in.nextInt();
		}
		
		int n2 = in.nextInt();
		int [] arr2 = new int [n2];
		
		for(int i = 0; i < n2; i++) {
			arr2[i] = in.nextInt();
		}
		
		int count = 0;
		
		
		
		for(int i = 0; i < n2; i++) {
			
			int left =0;
			int right = n;
			int mid = (left + right) / 2;
			
			while(left != mid && right != mid) {
				
				if(arr2[i] == arr[mid]) {
					count++;
					break;
				}
				
				else if(arr2[i] < arr[mid]) {
					right = mid;
					mid = (left + right) / 2;
				}
				
				else {
					left = mid;
					mid = (left + right) / 2;
				}
			}
		}
		
		System.out.println(count);
}

}

