#include <bits/stdc++.h>
#include <fstream>
#include <vector>
#include <bitset>
#include <unordered_map>
#include <algorithm>
#include <queue>
#include <math.h>
#include <iomanip>
#include <stack>
#include <string.h>
#include <set>
 
using namespace std;
 
ifstream in("dtcsu.in");
ofstream out("dtcsu.out");

unordered_set <long long> H;

long long x;
int q, nr;

int main()
{
	for(int i = 1; i <= 276997; i++)
	{
		in >> x;
		
		H.insert(x / (x & -x));
	}
	
	in >> q;
	
	while(q--)
	{
		in >> x;
		
		if(x == 0)
			continue;
		
		if(H.find(x / (x & -x)) != H.end())
			nr++;
	}
	
	out << nr;
	return 0;
}