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 S[];
	static int n;
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		n = scan.nextInt();
		S = new int[n];
		for(int i = 0;i < n;i++)S[i] = scan.nextInt();
		int q = scan.nextInt();
		int c = 0;
		for(int i = 0;i < q;i++) {
			if(search(scan.nextInt()))c++;

		}

		System.out.println(c);
		scan.close();

	}

	static boolean search(int t) {
		int l = 0, r = n, mid;
		if(S[0] > t || S[n-1] < t)return false;

		while(l<r) {
			mid = (l+r)/2;
			if(S[mid] > t) {
				r = (l+r)/2;
			}else if(S[mid] < t){
				l = (l+r)/2+1;
			}else if(S[mid] == t)return true;

		}

		return false;

	}

}
