#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iterator>
#include <assert.h>
using namespace std;

const string file = "dtcsu";

const string infile = file + ".in";
const string outfile = file + ".out";

const int INF = 0x3f3f3f3f;

const int NRLINES = 276997;

int main()
{
	fstream fout(outfile.c_str(), ios::out);
	fstream fin(infile.c_str(), ios::in);
	

	vector<long long> nrs(NRLINES);

	for(int i = 0; i < NRLINES; i++)
	{
		fin >> nrs[i];
	}
	
	sort(nrs.begin(), nrs.end());

	int Q;
	fin >> Q;
	int Sol = 0;
	for(int i = 0; i < Q; i++)
	{
		long long val;
		fin >> val;
		if(lower_bound(nrs.begin(), nrs.end(), val) == nrs.end())
		{

		}
		else
		{
			Sol++;
		}
	}

	fout << Sol << "\n";

	fin.close();
	fout.close();
	
}