//#pragma GCC optimize("Ofast,unroll-loops,O3")
//#pragma GCC optimize("avx,avx2,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,fma,tune=native")
#include<bits/stdc++.h>
//#include<bits/extc++.h>
//#pragma pack(1)
#define fast ios::sync_with_stdio(0); cin.tie(0);
#define int long long
#define pii pair<int,int>
#define x first
#define y second
#define N 300015
using namespace std;
//using namespace __gnu_pbds;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//typedef tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> order_multiset;
//typedef tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> order_set;
struct circle{
int x,y,r,i;
circle(int a=0,int b=0,int c=0,int d=0):x(a),y(b),r(c),i(d){}
bool operator<(const circle a)const{
if (r!=a.r) return r<a.r;
else return i>a.i;
}
bool intersect(circle c){
int dis=(c.x-x)*(c.x-x)+(c.y-y)*(c.y-y);
return dis<=(r+c.r)*(r+c.r);
}
};
int n,ans[N];
vector<circle>all;
set<int>st;
signed main(){
fast
cin>>n;
for (int i=1;i<=n;i++){
int a,b,c; cin>>a>>b>>c;
all.push_back(circle(a,b,c,i));
}
sort(all.begin(),all.end());
while (!all.empty()){
circle now=all.back(); all.pop_back();
if (ans[now.i]) continue;
ans[now.i]=now.i;
for (auto i:all){
if (ans[i.i]) continue;
if (now.intersect(i)){
ans[i.i]=now.i;
continue;
}
}
}
for (int i=1;i<=n;i++)
cout<<ans[i]<<" ";
cout<<'\n';
}
