#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define endl '\n'
#define ep insert
#define pow pwr
#define sqrt sqrtt
#define elif else if
#define y1 YONE
#define int long long
using namespace std;
struct circle{
int x,y,r,idx;
};
bool cmp1(circle x,circle y){
if (x.r!=y.r) return x.r>y.r;
return x.idx<y.idx;
}
int dis(int x1,int y1,int x2,int y2){
return (x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
}
bool cmp2(pair<pair<int,int>,int> x,pair<pair<int,int>,int> y){
if (x.F.S-x.F.F!=y.F.S-y.F.F) return x.F.S-x.F.F>y.F.S-y.F.F;
return x.S<y.S;
}
const int N=1e6+5;
int n,ans[N];
pair<pair<int,int>,int> a[N];
vector<int> adj[N];
map<int,int> mp;
circle b[N];
int32_t main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
cin>>n;
if (n>5000){
for (int i=1;i<=n;i++){
int x,y,r;
cin>>x>>y>>r;
a[i]={{x-r,x+r},i};
mp[x+r]++;
mp[x-r]++;
}
sort(a+1,a+1+n,cmp2);
int c=0;
for (auto u:mp){
c++;
mp[u.F]=c;
}
for (int i=1;i<=n;i++){
a[i].F={mp[a[i].F.F],mp[a[i].F.S]};
adj[a[i].F.F].pb(i);
adj[a[i].F.S].pb(i);
}
for (int i=1;i<=n;i++){
if (ans[a[i].S]) continue;
for (int j=a[i].F.F;j<=a[i].F.S;j++){
for (auto u:adj[j]){
if (!ans[a[u].S]) ans[a[u].S]=a[i].S;
}adj[j].clear();
}
}
for (int i=1;i<=n;i++) cout<<ans[i]<<' ';return 0;}
for (int i=1;i<=n;i++) {cin>>b[i].x>>b[i].y>>b[i].r;b[i].idx=i;}
sort(b+1,b+1+n,cmp1);
for (int i=1;i<=n;i++){
for (int j=1;j<=n;j++){
int x=dis(b[i].x,b[i].y,b[j].x,b[j].y),y=(b[i].r+b[j].r)*(b[i].r+b[j].r);
if (x>y) continue;
adj[i].pb(j);
}
}
for (int i=1;i<=n;i++){
if (ans[b[i].idx]) continue;
for (auto u:adj[i]){
if (ans[b[u].idx]) continue;
ans[b[u].idx]=b[i].idx;
}
}
for (int i=1;i<=n;i++) cout<<ans[i]<<' ';
return 0;
}
