#include <cstdio>
#include <tr1/unordered_set> // chiar nu stiam ca exista chestia asta
#define DIM 276997
using namespace std;

tr1::unordered_set <long long> mySet;

int Q, nr, i;
long long X;

int main(){

    freopen("dtcsu.in" ,"r", stdin );
    freopen("dtcsu.out","w", stdout);

    for(i = 1; i <= DIM; i ++){
        scanf("%lld", &X);

        if((X&1))
            mySet.insert(X);
    }

    scanf("%d", &Q);
    for(i = 1; i <= Q; i ++){
        scanf("%lld", &X);

        if(!X) continue;

        if(!(X&1) && ((X^(X-1))&X))
            X = X / ((X^(X-1))&X);

        if(mySet.find(X) != mySet.end()) // inspired by other well respected programmers
            nr ++;
    }

    printf("%d\n", nr);

    fclose(stdin );
    fclose(stdout);

    return 0;
}