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

public class Main {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		int S[] = new int[n];
		int count = 0;
		
		for (int k = 0; k <= n - 1; k++) {
			int x = scanner.nextInt();
			S[k] = x;
		}
		
		int q = scanner.nextInt();
		int T[] = new int[q];
		
		for (int k = 0; k <= q - 1; k++) {
			int x = scanner.nextInt();
			T[k] = x;
		}//SとTを配列にいれる
		
		Arrays.sort(S);
		int mid = (n - 1) / 2;

		for (int i = 0; i <= q - 1; i++) {
			if (T[i] == S[mid]) {
				count += 1;
			} else if (T[i] <= S[mid]) {
				for (int j = 0; j <= mid; j++) {
					if (S[j] == T[i]) {
						count += 1;
						break;
			}
				}
			}else {
				for (int k = mid + 1; k <= n - 1; k++) {
					if (S[k] == T[i]) {
						count += 1;
						break;
				}
			}
		}
				}
		System.out.println (count);
}
}
