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) {
        Scanner scn = new Scanner(System.in);

        int number = scn.nextInt();
        int [] box;
        box = new int[number];
        for(int i = 0; i < number; i++) box[i] = scn.nextInt();

        int count = scn.nextInt();
        int answer = 0;
        for(int j = 0; j < count; j++){
            int check = scn.nextInt();
            if(solve(check,number,box)) answer++;
        }
        System.out.println(answer);
    }
    static boolean solve(int check, int max,int[] box){
        int right = max;
        int left = 0;
        int mid = 0;
        while(left < right){
            mid = (left + right)/2;
            if(box[mid] == check) return true;
            else if(box[mid] < check) left = mid + 1;
            else if(box[mid] > check) right = mid;
        }
        return false;
    }
}
