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
#include "bits/stdc++.h"
using namespace std;
int main() {
	long long N;
	cin >> N;
	vector<int>A(N);
	for (long long i = 0; i < N; i++) {
		cin >> A.at(i);
	}
	int M;
	cin >> M;
	vector<int>T(M);
	long long C = 0;
	for (long long i = 0; i < M; i++) {
		cin >> T.at(i);
		bool check = binary_search(A.begin(), A.end(), T.at(i));
		if (check) C++;
	}
	cout << C << endl;
}

