#include <fstream>
#include <unordered_set>

using namespace std;

const int MAX = 276997;

int Q, cnt;
long long val;

unordered_set<long long> S;

int main() {
    ifstream in("dtcsu.in");
    for(int i = 1; i <= MAX; i++) {
        in >> val;
        if(val & 1) S.insert(val);
    }
    in >> Q;
    for(int i = 1; i <= Q; i++) {
        in >> val;
        if((val & (-val))) val /= (val & (-val));
        if(S.find(val) != S.end()) cnt++;
    } in.close();
    ofstream out("dtcsu.out"); out << cnt << "\n"; out.close();
}