Closest Points

//Bismillahir Rahmanir Rahim
/******Harun Or Rashid******/
/***********Template Starts Here***********/
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cctype>
#include<cstdlib>
#include<string>
#include<vector>
#include<set>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
using namespace std;

#define MEM(a,b) memset(a,b,sizeof(a))
#define CLR(a) memset(a,0,sizeof(a))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)>(b)?(b):(a))
#define ABS(a) ((a)>0? (a):(-(a)))
#define SQ(a) ((a)*(a))
#define SZ(a) (int)a.size()
#define FORN(i,n) for(i=1;i<=n;i++)
#define FORAB(i,a,b) for(i=a;i<=b;i++)
#define ALL(V) V.begin(),V.end()
#define pb(a) push_back(a)
#define pr(a) cout<<a<<endl
#define pf printf
#define sf scanf
#define swap(a,b) (a ^= b, b ^= a, a ^= b)
#define PI acos(-1)
#define x first
#define y second
#define eps 1e-7

typedef int D;
typedef long long int LLD;
typedef unsigned long long int LLU;
typedef vector<D> VI;
typedef set<D> SI;
typedef vector<D>::iterator Viti;

/***********Template Ends Here***********/

int main()
{
    int N,Q,i;
    LLU mx,pos,tm;
    cin>>N;
    int center[N][3];
    for(i=0; i<N; i++)
        cin>>center[i][0]>>center[i][1]>>center[i][2];
    cin>>Q;
    int bank[Q][3];
    for(i=0; i<Q; i++)
        cin>>bank[i][0]>>bank[i][1]>>bank[i][2];
    mx=pow(bank[0][0]-center[0][0],2)+pow(bank[0][1]-center[0][1],2)+pow(bank[0][2]-center[0][2],2);
    pos=0;
    for(i=1; i<N; i++)
    {
        tm=pow(bank[0][0]-center[i][0],2)+pow(bank[0][1]-center[i][1],2)+pow(bank[0][2]-center[i][2],2);
        if(tm<mx)
        {
            mx=tm;
            pos=i;
        }
    }
    for(i=0; i<Q; i++)
        cout<<pos<<endl;
    return 0;
}