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

*/

vector<long long> h[P];

void Adauga(long long x)
{
    int r = x % P;
    h[r].push_back(x);
}

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

/**
Se da un sir a1, a2, ..., an. Sa se verifice daca exista doua
elemente egale in sir.
8
1 5 2000000000 17 5 2 18 3
*/
ifstream fin("dtcsu.in");
ofstream fout("dtcsu.out");
int main()
{
    int i, Q, cnt = 0;
    long long x;
    for (i = 1; i <= 276997; i++)
    {
        fin >> x;
        while (x % 2 == 0) x /= 2;
        if (Cauta(x) == 0)
            Adauga(x);
    }
    fin >> Q;
    for (i = 1; i <= Q; i++)
    {
        fin >> x;
        while (x % 2 == 0) x /= 2;
        cnt += Cauta(x);
    }
    fout << cnt << "\n";
    fout.close();
    return 0;
}