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) {		int n, sum = 0;		Scanner sc = new Scanner(System.in);		n = sc.nextInt();		int[] S = new int[100001];		for (int i = 0; i < n; i++) {			S[i] = sc.nextInt();		}		int q, key = 0;		q = sc.nextInt();		for (int i = 0; i < q; i++) {			key = sc.nextInt();			if (binarySearch(S, n, key))				sum++;		}		System.out.println(sum);	}	private static boolean binarySearch(int[] S, int n, int key) {		int left = 0;		int right = n - 1;		while (left <= right) {			int mid = (left + right) / 2;			if (key == S[mid])				return true;			else if (key > S[mid])				left = mid + 1;			else				right = mid - 1;		}		return false;	}}
