#include<cstdio>
#include<bitset>
#include<algorithm>
#include<vector>

#define NMAX 276997
#define LL long long

using namespace std;

FILE *fin,*fout;

int q,sol;
LL n,nr;
vector<LL> v;

const int SZ=100000;
char input[SZ+1],*in;

inline LL conv()
{
	LL nr=0;
	for(;!(*in>='0' && *in<='9') && *in;in++);
	if(in==input+SZ)
	{
		fread(input,1,SZ,fin);
		in=input;
	}
	for(;*in>='0' && *in<='9';in++)
	{
		nr=nr*10+(*in-'0');
		if(in+1==input+SZ)
		{
			fread(input,1,SZ,fin);
			in=input-1;
		}
	}
	return nr;
}

int main()
{
	fin=fopen("dtcsu.in","r");
	fout=fopen("dtcsu.out","w");
	fread(input,1,SZ,fin);
	in=input;
	for(int i=0;i<NMAX;i++)
	{
		n=conv();
		if(!(n&1))
			continue;
		v.push_back(n);
	}
	
	q=conv();
	for(;q;q--)
	{
		n=conv();
		if( (n&(n-1))==0 )
		{
			sol++;
			continue;
		}
		for(;!(n&1);n>>=1);
		sol+=(binary_search(v.begin(),v.end(),n));
	}
	fprintf(fout,"%d",sol);
	return 0;
}