#include<fstream>
#include<algorithm>
using namespace std;
typedef struct celula{
           long long val;
           celula *next;
           }*lista;
const int mod=9001;
lista h[9001],v;
int i,q,x,sol;
 
void baga(long long val) {
       long long r=val%mod;
       v=new celula; v->val=val; v->next=h[r]; h[r]=v;
}
 
bool este(long long val) {
     long long r=val%mod;
       bool ok=0;
       for (lista p=h[r]; p; p=p->next) 
        if (p->val==val) { ok=0; break; }
       return(ok);
}
 
int main(void) {
     ifstream fin("dtcsu.in");
     ofstream fout("dtcsu.out");
     for (i=1; i<=276997; ++i) {
           fin>>x;
           if (x%2==1) baga(x);
           }
     fin>>q;
     for (i=1; i<=q; ++i) {
           fin>>x;
           if (x==0) continue;
           x/=(x&(-x));
           if ( este(x) ) ++sol;
           }
   fout<<sol;
 return(0);
}