#include <fstream>
//#include<cstdio>
#include<vector>
//#include<algorithm>
using namespace std;
ifstream fin("dtcsu.in");
ofstream fout("dtcsu.out");
//FILE *fin=fopen("dtcsu.in","r");
//FILE *fout=fopen("dtcsu.out","w");

vector<int> v[9013];
vector<int> ::iterator it;
int mod=9013;
int n,i,sol;
long long x;

bool Find()
{
    for(it=v[x%mod].begin();it!=v[x%mod].end();++it)
    {
        if((*it)==x)
            return true;
    }
    return false;
}

int main()
{
    for(i=1;i<=276997;++i)
    {
        fin>>x;
        if(x%2) v[x%mod].push_back(x);
    }
    fin>>n;
    for(i=1;i<=n;++i)
    {
        fin>>x;
        while(!(x%2))x/=2;
        if(Find()) sol++;
    }
    fout<<sol;


    return 0;
}