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.HashSet;
import java.util.Set;

public class Main {

	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int size = Integer.parseInt(br.readLine());
		Set<String> set = new HashSet<String>();
		String[] strInputNums = br.readLine().split(" ");
		for (int i = 0; i < size; i++) {
			if (!set.contains(strInputNums[i])) {
				set.add(strInputNums[i]);
			}
		}
		size = Integer.parseInt(br.readLine());
		strInputNums = br.readLine().split(" ");
		int matchCnt = 0;
		for (int i = 0; i < size; i++) {
			if (set.contains(strInputNums[i])) {
				matchCnt++;
			}
		}
		System.out.println(matchCnt);
	}
}