#include <bits/stdc++.h>
#define P 8887
using namespace std;

ifstream fin("dtcsu.in");
ofstream fout("dtcsu.out");
vector <long long> M[P];

bool Search(int x)
{
    int r = x % P;
    for (long long e : M[r])
        if (e == x)
            return 1;
    return 0;
}

void Add(int x)
{
    int r = x % P;
    M[r].push_back(x);
}

int main()
{
    int i, n, Q, cnt = 0;
    long long x;
    for (i = 1; i <= 276997; i++)
    {
        fin >> x;
        x /= (x & (-x));
        if (!x) continue;
        Add(x);
    }
    fin >> Q;
    while (Q--)
    {
        fin >> x;
        if (!x) continue;
        x /= (x & (-x));
        if (Search(x)) cnt++;
    }
    fout << cnt << "\n";
    return 0;
}