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

unordered_set<long long> h;
long long x;
long long q,sol;
int main()
{
    freopen("dtcsu.in","r",stdin);
    freopen("dtcsu.out","w",stdout);

    for(int i=1;i<=276997;i++)
    {
        scanf("%lld",&x);
        h.insert(x/((x&(-x))));
    }

    scanf("%lld",&q);
    while(q--)
    {
        scanf("%lld",&x);
        if(h.find(x/(x&(-x)))!=h.end()) sol++;
    }

    printf("%lld\n",sol);
    return 0;
}