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 Scanner sc = new Scanner(System.in);
    static int n = Integer.parseInt(sc.next());
    static int[] a = new int[100000];

    public static void main(String[] args){
        int q,key,sum = 0;
        for (int i = 0; i < n; i++) {
            a[i] = Integer.parseInt(sc.next());
        }
        q = Integer.parseInt(sc.next());
        for (int i = 0; i < q; i++) {
            key = Integer.parseInt(sc.next());
            if(binarySearch(key)) sum++;
        }
        System.out.println(sum);
    }

    static boolean binarySearch(int key){
        int left = 0;
        int right = n;
        int mid;
        while(left < right){
            mid = (left + right)/2;
            if(key == a[mid]) return true;
            if (key > a[mid]) left = mid + 1;
            else if (key < a[mid]) right = mid;
        }
        return false;
    }
}
