#include <iostream>
#include <fstream>
#include <tr1/unordered_set>

using namespace std;

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

tr1 :: unordered_set <int> S;

int main()
{
    int N, Ans = 0;
    long long X;

    N = 276997;
    while (N --){
        in >> X;
        if (X % 2)
            S.insert (X);
    }

    in >> N;
    while (N --){
        in >> X;

        if (X == 0)
            continue;

        if (X % 2 == 0)
            X /= (X & (-X));
        if (S.count (X))
            Ans ++;
    }

    out << Ans;

    return 0;
}