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 int n;
    public static int S[];
    public static int q;
    public static int T[];
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        n=sc.nextInt();
        S=new int[n];
        for(int i=0;i<n;i++) S[i]=sc.nextInt();
        q=sc.nextInt();
        T=new int[q];
        for(int i=0;i<q;i++) T[i]=sc.nextInt();
        int count=0;
        for(int i=0;i<q;i++){
            if(binary_search(T[i])){
            count++;
            }
        }
        System.out.println (count);
        sc.close();
    }
    private static boolean binary_search(int key){
        int left=0;
        int right=n-1;
        while(right>=left){
            int mid=(left+right)/2;
            if(S[mid]==key) return true;
            else if (S[mid] > key) right = mid - 1;
            else if (S[mid] < key) left = mid + 1;
        }
        return false;
    }
}
