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 scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		int[] sArray = new int[n];
		for (int i = 0; i < n; i++) {
			sArray[i] = scanner.nextInt();
		}
		int p = scanner.nextInt();
		int[] tArray = new int[p];
		int cnt = 0;
		for (int i = 0; i < p; i++) {
			tArray[i] = scanner.nextInt();
			if(binarySearch(sArray, tArray[i], 0, n-1)){
				cnt++;
			}
		}
		System.out.println(cnt);
	}
	
	public static boolean binarySearch(int[] sArray, int tElement, int start,
			int end) {

		if (tElement == sArray[(start + end) / 2]) {
			return true;
		} else if (start == end) {
			return false;
		} else {
			if (tElement < sArray[(start + end) / 2]) {
				return binarySearch(sArray, tElement, start,
						(start + end) / 2);
			} else {
				return binarySearch(sArray, tElement, (start + end) / 2+1, end);
			}
		}
	}
}