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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {

	public static void main(String[] args) throws NumberFormatException, IOException {
		// TODO 自動生成されたメソッド・スタブ
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		int n = Integer.parseInt(br.readLine());
		String[] str = br.readLine().split(" ");
		int[] S = new int[n];
		for(int i = 0; i < n; i++){
			S[i] = Integer.parseInt(str[i]);
		}
		
		int q = Integer.parseInt(br.readLine());
		str = br.readLine().split(" ");
		int count = 0;
		for(int i = 0; i < q; i++){
			
			int T = Integer.parseInt(str[i]);
			int left = 0, right = n;
			
			while(right != left){
				int half = (right + left)/2;
				if(S[half] < T){
					left = half + 1;
				} else if(S[half] > T){
					right = half;
				} else {
					count++;
					break;
				}
			}
		}
		System.out.println(count);
	}
}
