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.*;

class Main {

	static Scanner in = new Scanner(System.in);

    void solve() {
		int n = in.nextInt();
		int[] s = new int[n];
		for(int i = 0; i < n; i++) s[i] = in.nextInt();
		int q = in.nextInt();
		int[] t = new int[q];
		for(int i = 0; i < q; i++) t[i] = in.nextInt();
		int ans = 0;
		for(int i : t) if(serch(s, i) > 0) ans++;
		System.out.println(ans);
	}

	int serch(int[] a, int n){
		int left = 0;
		int right = a.length;
		int mid = -1;
		while(left < right){
			mid = (left + right) / 2;
			if(a[mid] == n) return 1;
			else if(n > a[mid]) left = mid + 1;
			else if(n < a[mid]) right = mid;
		}
		return 0;
	}

    public static void main(String[] args) {
        new Main().solve();
    }
}