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 {

	static int n, q;

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		n = sc.nextInt();
		int[] S = new int[n];
		for(int i = 0 ; i < n ; i++) S[i] = sc.nextInt();
		q = sc.nextInt();
		int[] T = new int[q];
		for(int i = 0 ; i < q ; i++) T[i] = sc.nextInt();
		Arrays.sort(S);

		long ans = 0;
		for(int i = 0 ; i < q ; i++) {
			if(binary_search(T[i], S)) ans++;
		}
		System.out.println(ans);
	}

	public static boolean binary_search(int x, int[] S) {
		int l = 0;
		int r = n;
		while(r > l) {
			int center = (l + r) / 2;
			if(x == S[center]) return true;
			else if(x > S[center]) l = center + 1;
			else r = center;
		}
		return false;
	}

}