#include<fstream>
#include<vector>
#include<algorithm>
using namespace std;

long long x;
int N,sol;
char aux[300];
vector <long long> v;

int main() {

    ifstream in("dtcsu.in");
    ofstream out("dtcsu.out");
    int i,st,dr,mij;
    for(i=1;i<=276997;i++) {
        in>>x;
        if(x%2==1)
            v.push_back(x);
    }
    sort(v.begin(),v.end());
    in>>N;
    for(i=1;i<=N;i++) {
        in>>x;
        if(x) {
            x=x/(x&(-x));
            st=0;dr=v.size()-1;
            while(st<=dr) {
                mij=(st+dr)/2;
                if(v[mij]==N) {
                    st=dr+1;
                    sol++;
                }
                if(v[mij]<x)
                    st=mij+1;
                if(v[mij]>x)
                    dr=mij-1;
            }
        }
    }
    out<<sol<<'\n';
    in.close();
    out.close();
    return 0;

}