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 = Integer.parseInt(sc.next());
		int[] a = new int[n];

		for (int i = 0; i < n; i++) {
			a[i] = Integer.parseInt(sc.next());
		}

		int m = Integer.parseInt(sc.next());
		int[] b = new int[m];
		for (int i = 0; i < m; i++) {
			b[i] = Integer.parseInt(sc.next());
		}

		int count = 0;
		for (int i = 0; i < m; i++) {
			int top = 0;
			int end = n;
			int pos = 0;
			while (top < end) {
				pos = (top + end) / 2;
				if (b[i] == a[pos]) {
					count++;
					break;
				} else if (b[i] > a[pos]) {
					top = pos;

				} else {
					end = pos;
				}
				if (pos == (top + end) / 2) {
					break;
				}
			}

		}

		System.out.println(count);

	}
}
