#include <bits/stdc++.h>
#pragma GCC optimize("O0")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pi;
#define MAX 301010
#define MAXS 20
#define INF 1000000010
#define bb ' '
#define ln '\n'
#define Ln '\n'
pair<pi, pi> in[MAX];
int X[MAX];
int Y[MAX];
int R[MAX];
int ind[MAX];
int ri[MAX];
int ans[MAX];
inline ll sq(ll x) {
return x * x;
}
inline bool chk(int i, int j) {
return sq(X[i] - X[j]) + sq(Y[i] - Y[j]) <= sq(R[i] + R[j]);
}
bool isrange(int x, int y) {
if (x < 0 || y < 0) return false;
return true;
}
inline ll trans(int x, int y) {
return ((ll)x * (ll)INF) + y;
}
bool cmp(pair<pi, pi>& p1, pair<pi, pi>& p2) {
if (p1.first.first == p2.first.first) return p1.first.second < p2.first.second;
else return p1.first.first > p2.first.first;
}
signed main() {
ios::sync_with_stdio(false), cin.tie(0);
int N;
cin >> N;
int i;
for (i = 1; i <= N; i++) cin >> in[i].second.first >> in[i].second.second >> in[i].first.first, in[i].first.second = i;
sort(in + 1, in + N + 1, cmp);
for (i = 1; i <= N; i++) tie(X[i], Y[i], R[i], ind[i]) = make_tuple(in[i].second.first + INF, in[i].second.second + INF, in[i].first.first, in[i].first.second);
int k;
int s, e;
e = 0;
for (k = 30; k >= 0; k--) {
int r = 1 << k;
s = e + 1;
if (R[s] < r / 2) continue;
e = 0;
vector<pair<ll, int>> vall;
for (i = s; i <= N; i++) {
if (ans[i]) continue;
int x, y;
x = X[i] >> k;
y = Y[i] >> k;
if (R[i] < r / 2 && !e) e = i - 1;
int xx, yy;
vall.emplace_back(((ll)x << 31LL) + y, i);
}
sort(vall.begin(), vall.end());
if (e == 0) e = N;
for (i = s; i <= e; i++) {
if (ans[i]) continue;
ans[i] = i;
int x, y;
x = X[i] / r;
y = Y[i] / r;
int xx, yy;
for (xx = x - 2; xx <= x + 2; xx++) for (yy = y - 2; yy <= y + 2; yy++) {
ll t = ((ll)xx << 31LL) + yy;
int ind = lower_bound(vall.begin(), vall.end(), make_pair(t, 0)) - vall.begin();
while (ind < vall.size() && vall[ind].first == t) {
if (ans[vall[ind].second]) {
ind++;
continue;
}
if (chk(vall[ind].second, i)) ans[vall[ind].second] = i;
ind++;
}
}
}
}
for (i = 1; i <= N; i++) ri[ind[i]] = i;
for (i = 1; i <= N; i++) cout << ind[ans[ri[i]]] << bb;
}
