#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
    fstream f_in{ "input.txt", ios::in }, f_out{ "output.txt", ios::out };
    int N; f_in >> N;
    vector<unsigned long long> distanze;
    distanze.reserve(N);
    for (int i = 0; i < N; i++)
    {
        unsigned long long x, y, z;
        f_in >> x >> y >> z;
        distanze.push_back(x*x + y*y + z*z);
    }
    auto begin = distanze.begin(), end = distanze.end();
    sort(begin, end);

    int Q; f_in >> Q;
    for (int i = 0; i < Q; i++)
    {
        unsigned long long D;
        f_in >> D; D *= D;
        f_out << upper_bound(begin, end, D) - begin << endl;
    }
    f_in.close();
    f_out.close();
    return 0;
}