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 int BS(int[] arr, int l, int r, int target) {
		if (l <= r) {
			int mid = l + (r - l) / 2;
			if (arr[mid] == target) {
				return mid;
			}
			if (arr[mid] > target) {
				return BS(arr, l, mid - 1, target);
			}
			return BS(arr, mid + 1, r, target);
		}
		return -1;
	}
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int[] sequence = new int[n];
		for (int i = 0; i < n; i++) {
			sequence[i] = in.nextInt();
		}
		
		int m = in.nextInt();
		int[] set_integer = new int[m];
		for (int i = 0; i < m; i++) {
			set_integer[i] = in.nextInt();
		}
		
		int res = 0;
		for (int i = 0; i < set_integer.length; i++) {
			int num = set_integer[i];
			if (BS(sequence, 0, n - 1, num) != -1) {
				res++;
			}
		}
		System.out.println(res);
		in.close();
	}
}
