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 boolean bunarySearch(int key, int n, int[] A) {
		int left = 0;
		int right = n;
		while (left < right) {
			int mid = (left + right) / 2;
			if (A[mid] == key) {
				return true;
			} else if (A[mid] < key) {
				left = mid + 1;
			} else {
				right = mid;
			}
		}
		return false;
	}

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int count = 0;
		int num1 = scanner.nextInt();
		int[] suretu1 = new int[num1 + 1];
		for (int i = 0; i < num1; i++) {
			suretu1[i] = scanner.nextInt();
		}
		int num2 = scanner.nextInt();
		int[] suretu2 = new int[num2];
		for (int i = 0; i < num2; i++) {
			suretu2[i] = scanner.nextInt();
		}
		for (int i = 0; i < num2; i++) {
			int key = suretu2[i];
			if (bunarySearch(key, num1, suretu1)) {
				count++;
			}
		}
		System.out.println(count);
		scanner.close();
	}

}

