#include <bits/stdc++.h>

#define MaxN 100005
#define INF 2140000000
#define MOD 10007
#define lcp(x) (x&(-x))

using namespace std;

FILE*IN,*OUT;

int Ans=0;
long long X,Q;
vector<long long>Hash[MaxN];

int main()
{

    IN=fopen("dtcsu.in","r");
    OUT=fopen("dtcsu.out","w");

    for(int i=1;i<=276997;i++)
    {
        fscanf(IN,"%lld",&X);
        if(X%2==1)
            Hash[X%MOD].push_back(X);
    }
    fscanf(IN,"%d",&Q);
    for(int i=1;i<=Q;i++)
    {
        fscanf(IN,"%d",&X);
        if(X)
            X/=lcp(X);
        int alfa=X%MOD;
        for(int i=0;i<v[alfa].size();i++)
        {
            if((X^v[alfa][i])==0)
            {
                Ans++;
                break;
            }
        }
    }
    fprintf(OUT,"%d",Ans);
    return 0;
}