#include<bits/stdc++.h>
using namespace std;
#define debug(x) cout << '[' << #x << " is: " << x << "] " << endl;
#define inF freopen("cardgame.in" , "r" , stdin);
#define outF freopen("cardgame.out" , "w" , stdout);
#define imod(a , n) (a % n + n ) % n
#define sor(v) sort(v.begin() , v.end());
#define print(v) for(auto f : v ) cout << f << " " ;
#define rsor(v) sort(v.rbegin() , v.rend());
#define rev(v) reverse(v.begin() , v.end());
#define scan(v)for(auto &it : v)cin >> it ;
#define ll long long
#define logar(x , y) log(x) / log(y)
#define __sum(n) n * (n + 1) / 2
#define __lcm(a , b) a / __gcd(a , b) * b
#define pii pair<int , int >
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);
//#define int ll
const int N = 2e5 + 3, M = N * 4 , MX = 2e4 + 40;
const ll MOD = 998244353 , oo = 1e9 + 9 , OO = 1e18 , mod = MOD ;
const double pi = acos(-1) , eps = 1e-17 ;
int di[] = {1 , -1 , 0 , 0};
int dj[] = {0 , 0 , 1 , -1};
struct data{
double x , y , r ;
};
bool compare(data a , data b){
return a.r < b.r ;
}
int32_t main()
{
// inF;
// inF;outF;
fastio;
//Welcome back without <TAWJIHI>
int n ;
cin >> n ;
int ans[n];
memset(ans , -1 , sizeof ans);
vector<data> v(n);
for(int i = 0 ; i < n ; i ++){
cin >> v[i].x >> v[i].y >> v[i].r ;
}
int cnt = n ;
while(cnt){
int pos = 0 ;
data mx;
mx.r = 0 ;
for(int i = 0 ; i < n ; i ++){
if(ans[i] != -1)continue ;
if(compare(mx , v[i]))pos = i , mx = v[i];
}
ans[pos] = pos + 1 ;
cnt -- ;
for(int i = 0 ; i < n ; i ++){
if(ans[i] != -1)continue ;
double d = sqrt((mx.x - v[i].x) * (mx.x - v[i].x) + (mx.y - v[i].y) * (mx.y - v[i].y));
double d2 = mx.r + v[i].r ;
if(d <= d2){
ans[i] = pos + 1 ;
cnt -- ;
}
}
}
for(int i = 0 ; i < n ; i ++)cout << ans[i] << " " ;
}
