#include <bits/stdc++.h>


using namespace std;



#define ll long long



set <ll>s;

ll x,n,total,i;



int main()

{

    freopen("dtcsu.in","r",stdin);

    freopen("dtcsu.out","w",stdout);

    for (i=1;i<=276997;i++){

        scanf("%lld",&x);

        s.insert(x/(x&-x));

    }

    scanf("%lld",&n);

    while (n){

        n--;

        scanf("%lld",&x);
        if (x==0) continue;

        if (s.find(x/(x&-x))!=s.end()){

            total++;

        }

    }

    printf("%lld",total);

    return 0;

}