#include<fstream>
#include<unordered_set>
using namespace std;
int i,q,x,sol;
unordered_set <long long> h;
 
int main(void) {
     ifstream fin("dtcsu.in");
     ofstream fout("dtcsu.out");
     for (i=1; i<=276997; ++i) {
           fin>>x;
           if (x%2==1) h.insert(x);
           }
     fin>>q;
     for (i=1; i<=q; ++i) {
           fin>>x;
           if (x==0) continue;
           x/=(x&(-x));
           if ( h.find(x)!=h.end() ) ++sol;
           }
   fout<<sol;
 return(0);
}