#include <bits/stdc++.h>
using namespace std;

#define P 19997
vector<long long> L[P+1];

int main()
{
	long long x;
    int i, M, cnt = 0, ok, r;
    unsigned int j;
	ifstream fin("dtcsu.in");
    ofstream fout("dtcsu.out");
    for (i=1; i <= 276997; i++)
    {
        fin >> x;
        if (x % 2 == 1)
            L[x%P].push_back(x);
    }
    fin >> M;
    for (i=1; i <= M; i++)
    {
        fin >> x;
        while (x % 2 == 0)
            x /= 2;
        ok =0;
        r = x % P;
        for (j=0; j<L[r].size() && ok==0; j++)
            if (L[r][j] == x) ok = 1;
        cnt += ok;
    }
    fout << cnt << "\n";
    fout.close();
    return 0;
}