#include<bits/stdc++.h>
using namespace std;
#define _ int v, int tl, int tr, int l, int r, ll x
#define tm (tl + tr >> 1)
#define sol v+v,tl,tm,l,r,x
#define sag v+v+1,tm+1,tr,l,r,x
#define mp make_pair
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef pair < int , int > pp;
const int mod = 1e9 + 7;
const int N = 3e5 + 5;
struct node{
int p[2],id;
node *l, *r;
node(int a[], int i) { l = r = NULL; p[0] = a[0]; p[1] = a[1]; id = i; }
};
int p[N][2],A[N],B[N],tmp[N],H[N],R[N],ans[N],r;
node* bld(int l, int r, int k){
if(l > r) return NULL;
int *X = k ? B : A;
int *Y = k ? A : B;
int i,j,jj, m = l+r >> 1;
node *root = new node(p[ X[m] ] , X[m]);
for(i=l;i<m;i++) H[ X[i] ] = 1;
for(j=l-1,jj=m,i=l;i<=r;i++){
if(H[ Y[i] ])
tmp[++j] = Y[i];
else if(Y[i] != X[m])
tmp[++jj] = Y[i];
}
for(i=l;i<=r;i++) { H[ X[i] ] = 0; Y[i] = tmp[i]; }
root -> l = bld(l,m-1,!k);
root -> r = bld(m+1,r,!k);
return root;
}
int ii;
void f(node* root, int p[], int k){
if(root == NULL) return;
ll a1 = root->p[0];
ll b1 = root->p[1];
ll a2 = p[0];
ll b2 = p[1];
ll c = R[ root->id ];
if((a1-a2)*(a1-a2) + (b1-b2)*(b1-b2) <= (r+c)*(r+c) && !ans[ root->id ])
ans[ root->id ] = ii;
if(p[k] < root->p[k]){
f(root->l,p,!k);
if(root->p[k] - p[k] <= r+r) f(root->r,p,!k);
}
else{
f(root->r,p,!k);
if(p[k] - root->p[k] <= r+r) f(root->l,p,!k);
}
}
int h;
bool cmp(int i, int j){
return p[i][h] < p[j][h];
}
int n,i,j;
pp T[N];
int main()
{
cin >> n;
for(i=1;i<=n;i++) { scanf("%d%d%d",&p[i][0],&p[i][1],&R[i]); A[i] = B[i] = i; }
h=0; sort(A+1,A+n+1,cmp);
h=1; sort(B+1,B+n+1,cmp);
node *root = bld(1,n,0);
for(i=1;i<=n;i++) T[i] = mp(-R[i] , i);
sort(T+1 , T+n+1);
for(i=1;i<=n;i++){
int id = T[i].nd;
if(ans[id]) continue;
r = R[id]; ii = id;
f(root , p[id], 0);
}
for(i=1;i<=n;i++) printf("%d ", ans[i]);
return 0;
}
