#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define in insert
#define pb push_back
#define ppb pop_back()
#define d3 ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define cans cout << ans << "\n";
#define yes cout << "Yes" << "\n";
#define no cout << "No" << "\n";
#define pll pair<ll,ll>
#define lin cout << "\n";
#define sqr 340
#define mod 1000000007
#define mid ((l+r)/2)
#define lc (2*n)
#define rc (2*n+1)
using namespace std;
ll fp(ll x , ll y)
{
if(y==0)
return 1;
ll z = fp(x,y/2);
if(y&1)
return z*z*x;
else
return z*z;
}
int sqrot(ll x)
{
int l = 0 , r = INT_MAX;
while(l<=r)
{
if(mid*mid>=x)
r=mid-1;
else
l=mid+1;
}
return r+1;
}
ll cel(ll x , ll y)
{
return x/y + bool(x%y);
}
string tb(ll x)
{
string s = "";
while(x>0)
{
if(x&1)
s+='1';
else
s+='0';
x/=2;
}
while(s.size()<60)
s+='0';
return s;
}
ll fb(string s)
{
ll x = 0;
ll c = 1;
for(int8_t i = 0 ; 60>i ; i++)
{
if(s[i]=='1')
x+=c;
c*=2;
}
return x;
}
ll x[5009] , y[5009] , r[5009] , ans[5009];
int main()
{
ll n;
cin >> n;
set<pll> s;
for(int i = 0 ; n>i ; i++)
{
cin >> x[i] >> y[i] >> r[i];
s.in({r[i],-i});
}
while(!s.empty())
{
auto it = s.end();
it--;
ll c = -it->S;
for(int i = 0 ; n>i ; i++)
{
ll d1 = (x[i]-x[c])*(x[i]-x[c]) + (y[i]-y[c])*(y[i]-y[c]);
ll d2 = (r[i]+r[c])*(r[i]+r[c]);
if(d1<=d2)
{
it = s.find({r[i],-i});
if(it==s.end())
continue;
ans[i]=c+1;
s.erase(it);
}
}
}
for(int i = 0 ; n>i ; i++)
cout << ans[i] << " ";
}
