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 {

	static int count = 0;

	public static void main(String[] args) throws Exception {

		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		long[] S = new long[n];

		for(int i = 0; i < n; i++) {
			S[i] = sc.nextLong();
		}

		int q = sc.nextInt();

		for(int j = 0; j < q; j++) {

			long T = sc.nextLong();
			binarySearch(S, T);
		}
		System.out.println(count);
	}
	
	public static void binarySearch(long[] S, long T) {
		int left = 0;
		int right = S.length;
		
		while(left < right) {
			int mid = (left + right) / 2;
			if(S[mid] == T) {
				count++;
				return;
			} else if(S[mid] > T) {
				right = mid;
			} else if(S[mid] < T) {
				left = mid + 1;
			}
		}
	}

}
