// Null
#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'
using namespace std;
typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const ll Mod = 1000000007LL;
const int N = 5e3 + 10;
const ll Inf = 2242545357980376863LL;
const ll Log = 30;
int n, x[N], y[N], r[N];
int mk[N];
map<pii, vector<int>> mp;
void Build(int L){
mp.clear();
for(int i = 1; i <= n; i++){
if(mk[i]) continue;
mp[{x[i]/L, y[i]/L}].pb(i);
}
}
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
for(int i = 1; i <= n; i++){
cin >> x[i] >> y[i] >> r[i];
}
vector<int> I(n); iota(all(I), 1);
sort(all(I), [&](int i, int j){
return (r[i] == r[j] ? i < j : r[i] > r[j]);
});
int L = 1 << 31;
Build(L);
for(auto id : I){
if(mk[id]) continue;
int fl = 0;
while(L >= r[id] + r[id]) L >>= 1, fl = 1;
if(fl) Build(L);
int i = x[id] / L;
int j = y[id] / L;
for(int i2 = i - 2; i2 <= i + 2; i2 ++) for(int j2 = j - 2; j2 <= j + 2; j2 ++){
if(mp.count({i2, j2})){
for(auto &nei : mp[{i2, j2}]){
if(mk[nei]) continue;
if(1ll*(x[id] - x[nei])*(x[id] - x[nei]) + 1ll*(y[id] - y[nei])*(y[id] - y[nei]) <= 1ll*(r[id] + r[nei])*(r[id] + r[nei]) ){
mk[nei] = id;
}
}
}
}
}
for(int i = 1; i <= n; i++) cout << mk[i] << ' ';
cout << '\n';
return 0;
}
/*
11
9 9 2
13 2 1
11 8 2
3 3 2
3 12 1
12 14 1
9 8 5
2 8 2
5 2 1
14 4 2
14 14 1
*/
