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 {

    public static boolean bsearch(ArrayList<Integer> a, int left, int right, int goal) {
        while (left <= right) {
            int mid = (left + right) / 2;
            if (a.get(mid) < goal) {
                left = mid + 1;
            } else if (a.get(mid) > goal) {
                right = mid - 1;
            } else {
                return true;
            }
        }
        return false;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        ArrayList<Integer> s = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            s.add(in.nextInt());
        }
        Collections.sort(s);
        n = in.nextInt();
        int res = 0;
        for (int i = 0; i < n; i++) {
            if (bsearch(s, 0, s.size() - 1, in.nextInt())) {
                res += 1;
            }
        }
        System.out.println(res);
    }
}