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 sc = new Scanner(System.in);
		int n = sc.nextInt();
		int s[] = new int[n];
		for (int i = 0; i < n; i++) {
			s[i] = sc.nextInt();
		}

		int q = sc.nextInt();
		int t[] = new int[q];

		for (int i = 0; i < q; i++) {
			t[i] = sc.nextInt();
		}

		System.out.println(countNumbers(n, s, q, t));
	}

	public static boolean isIncludeNumber(int n, int s[], int num) {
		for (int i = 0; i < n; i++) {
			if (s[i] == num) {
				return true;
			}
		}
		return false;
	}

	public static int countNumbers(int n, int s[], int q, int t[]) {
		int count = 0;
		for (int j = 0; j < q; j++) {
			if (isIncludeNumber(n, s, t[j])) {
				count++;
			}
		}
		return count;
	}
}

