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

class Main{
	public static void main(String[] args) throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int n = Integer.parseInt(br.readLine());
		Deque<Integer> stack = new ArrayDeque<Integer>();
		String[] str = (br.readLine()).split(" ");
		int count = 0;
		for (int i = 0 ; i<n ; i++ ) {
			stack.addLast(Integer.parseInt(str[i]));
		}
		int q = Integer.parseInt(br.readLine());
		String[] st = (br.readLine()).split(" ");
		int[] num = new int[q];
		for (int i = 0; i<q ; i++ ) {
			num[i] = Integer.parseInt(st[i]);
		}

		Arrays.sort(num);

		int a;
		try{

			for (int i = 0; i<q ; i++ ) {
				while((a = stack.pollFirst()) < num[i]);
				if (num[i] == a) {
					count++;	
				}else{

					stack.addFirst(a);
					continue;
				}
			}
		}catch (NullPointerException e){

		}

		System.out.println(count);
	}

}