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.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {
	static List<Integer> s;
	static int count;

	public static void binarySearch(int value) {
		int left = 0, right = s.size();
		while (left < right) {
			int mid = (left + right) / 2;
			if (s.get(mid).intValue() == value) {
				count++;
				break;
			} else if(value < s.get(mid)){
				right = mid;
			} else {
				left = mid + 1;
			}
			mid = (left + right) / 2;
		}
	}

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		s = new ArrayList<>();
		for(int i = 0; i < n; i++) {
			s.add(sc.nextInt());
		}
		int q = sc.nextInt();
		count = 0;
		for (int i = 0; i < q; i++) {
			binarySearch(sc.nextInt());
		}
		System.out.println(count);
	}
}
