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;

class Main{
    public static void main(String[] args){
	int i;
	int j;
	int key;
	int count = 0;
	Scanner scan = new Scanner(System.in);

	int n = scan.nextInt();
	int S[] = new int[n];
	for(i=0 ; i<n ; i++){S[i] = scan.nextInt();}

	int q = scan.nextInt();
	int T[] = new int[q];
	for(j=0 ; j<q ; j++){T[j] = scan.nextInt();}

	int l;
	int r;
	int m;
	for(j=0 ; j<q ; j++){
	    key = T[j];
	    l = 0;
	    r = n;
	    m = (l+r)/2;
	    
	    while(true){
		if(key > S[n-1]){break;}
		
		if(key == S[m]){
		    count++;
		    break;
		}
		else if(key!=S[m] && l==m){break;}
		
		else if(key < S[m]){
		    r = m;
		    m = (l+r)/2;
		}
		else if(key > S[m]){
		    l = m+1;
		    m = (l+r)/2;
		}
	    }
	}

	System.out.println(count);

    }
}

