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.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

public class Main {
	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		br.readLine();
		String[] tmp = br.readLine().split(" ");
		List<Integer> S = new ArrayList<Integer>();
		S.add(Integer.parseInt(tmp[0]));
		for (int i = 1; i < tmp.length; i++) {
			if (!tmp[i].equals(tmp[i - 1]))
				S.add(Integer.parseInt(tmp[i]));
		}
		br.readLine();
		String[] T = br.readLine().split(" ");

		int cnt = 0;
		for (String s : T) {
			if (Collections.binarySearch(S, Integer.parseInt(s)) >= 0) {
				cnt++;
			}
		}
		System.out.println(cnt);

		if (br != null) {
			br.close();
			br = null;
		}
	}
}