#include <fstream>
#include <unordered_set>
using namespace std;

ifstream fin("dtcsu.in");
ofstream fout("dtcsu.out");
const int NMAX = 276997;

unordered_set<long long> mySet;
int ret;

int main() {
  for (int i = 0; i < NMAX; ++i) {
    long long x; fin >> x;
    if (x & 1)
      mySet.insert(x);
  }

  int Q; fin >> Q;
  for(int i = 1; i <= Q; ++i) {
    long long x; fin >> x;
    while(!(x & 1))
      x >>= 1;

    if(mySet.find(x) != mySet.end())
      ++ret;
  }

  fout << ret;
  return 0;
}