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.Arrays;
import java.util.Scanner;

import javax.sound.midi.MidiChannel;

public class Main {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		int[] S = new int[n];
		for (int i = 0; i < n; i++) {
			S[i] = scan.nextInt();
		}
		int q = scan.nextInt();
		int[] T = new int[q];
		for (int i = 0; i < T.length; i++) {
			T[i] = scan.nextInt();
		}
		int count = 0;
		for(int t: T){
			if (binarySearch2(S, t)) {
				count++;
			}		
		}
		
		System.out.println(count);
		scan.close();
	}

	
	public static boolean binarySearch2(int[] S, int key) {
		boolean ans = false;
		int left = 0;
		int right = S.length;
		while(left < right){
			int mid = (left + right) / 2;
			if (S[mid] == key) {
				return true;
			}else if (key < S[mid]) {
				right = mid;
			}else{
				left = mid + 1;
			}
		}
		return ans;
		
	}
}