#include <fstream>
#include <vector>
#define Nrlinii 276997
#define P 2013

using namespace std;

vector <int> H[P+2];

inline void AdaugaHash(int x)
{
    int i=x%P;
    H[i].push_back(x);
}

inline int CautaHash(int x)
{
    int i=x%P,len,j;
    len=H[i].size();
    for(j=0;j<len;++j)
        if(H[i][j]==x)
            return 1;
    return -1;
}

int main()
{
    int sol=0,x,Q,i;
    ifstream fin("dtcsu.in");
    for(i=1;i<=Nrlinii;++i)
    {
        fin>>x;
        if(x&1)
            AdaugaHash(x);
    }
    fin>>Q;
    while(Q--)
    {
        fin>>x;
        if(CautaHash(x/(x&(-x)))!=-1)
            ++sol;
    }
    ofstream fout("dtcsu.out");
    fout<<sol<<"\n";
    fout.close();
    return 0;
}