#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<ll,ll,ll> ti;
typedef vector<ll> li;
typedef vector<li> lii;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;
vector<ti> a;
set<tuple<ll,ll,int>> st;
vi ans;
bool ok(int x,int y){
ll x1=get<0>(a[x]);
ll y1=get<1>(a[x]);
ll z1=get<2>(a[x]);
ll x2=get<0>(a[y]);
ll y2=get<1>(a[y]);
ll z2=get<2>(a[y]);
return ((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)<=(z1+z2)*(z1+z2));
}
int main() {
// ios::sync_with_stdio(0);
// cin.tie(0);
int n;cin>>n;
a.resize(n);
priority_queue<pair<ll,int>> pq;
ll mx=0;
ans.resize(n);
REP(i,0,n)ans[i]=i;
REP(i,0,n){
ll x,y,z;cin>>x>>y>>z;
x+=1e9;y+=1e9;
a[i]={x,y,z};
pq.push({z,-i});
st.insert({x,y,i});
mx=max(mx,z);
}
int t=log2(mx)+1;
ll sz=(1<<t);
ll pos=0;
while(!pq.empty()){
ll r=pq.top().F;
int pos=-pq.top().S;
pq.pop();
if(ans[pos]!=pos)continue;
if(r<=sz/2)sz/=2;
ll x=get<0>(a[pos]);
ll y=get<1>(a[pos]);
st.erase({x,y,pos});
x-=x%sz+2*sz;
y-=y%sz+2*sz;
REP(i,0,5){
auto it=st.lower_bound({x,y,-1});
while(it!=st.end()&&get<1>(*it)<=y+5*sz){
auto it2=it;
it++;
if(ok(pos,get<2>(*it2))){
ans[get<2>(*it2)]=pos;
st.erase(it2);
}
}
x+=sz;
}
}
REP(i,0,n)cout<<ans[i]+1<<" ";
}
