#include<cstdio>
#include<cstring>
#include<algorithm>
#include<set>
#define nmax 3
using namespace std;
int n,i,j,k;
set <long long> s;
long long x;

int main()
{
    freopen("dtcsu.in","r",stdin);
    freopen("dtcsu.out","w",stdout);
    for (i=1;i<=nmax;i++)
    {
        scanf("%lld",&x);
        if (x&1) s.insert(x);
    }
    scanf("%d",&n);
    for (i=1;i<=n;i++)
    {
        scanf("%lld",&x);
        if (x!=0)
        {
            while (!(x&1)) x>>=1;
            if (s.find(x)!=s.end()) k++;
        }
    }
    printf("%d\n",k);
    return 0;
}