#include<cstdio>
#include<unordered_set>

using namespace std;

unordered_set<long long> h;
int n = 276997;
long long ans;

int main() {

    freopen("dtcsu.in", "r", stdin);
    freopen("dtcsu.out", "w", stdout);

    long long val;

    while(n--) {
        scanf("%lld",&val);
        if(val % 2 == 1)
            h.insert(val);
    }

    scanf("%d",&n);
    while(n--) {
        scanf("%lld",&val);
        if(val == 0)
            continue;
        val /= (val & -val);
        if(h.find(val) != h.end())
            ++ans;
    }

    printf("%lld\n",ans);

    return 0;
}