//by szh
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}
const int maxn = 5050;
int n;
ll x[maxn],y[maxn],r[maxn];
bool removed[maxn];
int cnt = 0;
int ans[maxn];
int main() {
// freopen("input.txt","r",stdin);
std::ios::sync_with_stdio(false);cin.tie(0);
cin>>n;
rep(i,0,n) cin>>x[i]>>y[i]>>r[i];
while (cnt!=n) {
int cur = -1;
rep(i,0,n) {
if (removed[i]) continue;
if (cur==-1 or r[i]>r[cur]) cur = i;
}
rep(i,0,n) {
if (removed[i]) continue;
if ((x[i]-x[cur])*(x[i]-x[cur]) + (y[i]-y[cur])*(y[i]-y[cur]) <= (r[i]+r[cur])*(r[i]+r[cur])) {
removed[i] = 1;
ans[i] = cur;
cnt++;
}
}
}
rep(i,0,n) cout<<ans[i]+1<<" ";
return 0;
}
