#include <fstream>
#include <vector>

#define in "dtcsu.in"
#define out "dtcsu.out"
#define MOD 10013
#define Max_N 276997
#define LL long long

std :: ifstream f(in);
std :: ofstream g(out);

int Q;

std :: vector < LL > Hash[MOD];

inline void Read_Data()
{
    LL x;

    for(int i = 1; i <= Max_N; ++i)
    {
        f >> x;
        if(x % 2)   Hash[x % MOD].push_back(x);
    }
    f >> Q;

}

inline void Solve()
{
    int sol = 0;
    LL x;
    std :: vector < LL > :: iterator it;

    for(int i = 1; i <= Q; ++i)
    {
        f >> x;
        for(it = Hash[x % MOD].begin(); it != Hash[x % MOD].end(); ++it)
            if(*it == x)    ++sol;
    }

    g << sol << '\n';
}

int main()
{
    Read_Data();
    Solve();

    g.close();
    return 0;
}