#include <iostream>
using namespace std;
#include <vector>
#include <unordered_set>
#define NUMERE 276997

unordered_set <long long> Hash;

int main() {
  FILE *fin, *fout;
  int t, nr, i;
  long long a;
  fin = fopen( "dtcsu.in", "r" );
  for( i = 0; i < NUMERE; i++ ) {
    fscanf( fin, "%lld", &a );
    if( a % 2 == 1 )
      Hash.insert(a);
  }
  fscanf( fin, "%d", &t );
  nr = 0;
  while( t-- ) {
    fscanf( fin, "%lld", &a );
    while( a % 2 == 0 )
      a /= 2;
    if( Hash.find(a) != Hash.end() )
      nr++;
  }
  fclose( fin );
  fout = fopen( "dtcsu.out", "w" );
  fprintf( fout, "%d", nr );
  fclose( fout );
  return 0;
}