#include <fstream>
#include <map>

using namespace std;

ifstream fin("dtcsu.in");
ofstream fout("dtcsu.out");

int Q, lg, sol;
long long N;
map<long long, bool> H;

int main()
{
    long long x;
    for (int i = 1; i <= 276997; ++i)
    {
        fin >> x;

        if (x & 1)
            H[x] = true;
    }
    fin >> Q;
    while (Q--)
    {
        fin >> N;

        if (N & -N)
            N /= (N & -N);

        if (H[N])
            ++sol;
    }

    fout << sol << '\n';

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