#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
// const int K = 2;
int N;
int X[303030];
int Y[303030];
int R[303030];
int XL[303030];
int XR[303030];
int ans[303030];
int cur;
char rr;
void rf(int &x) {
x = 0;
int sgn = 0;
while (rr < 48 && rr != '-') rr = getchar();
if (rr == '-') { sgn = 1; rr = getchar(); }
while (47 < rr) { x = (x << 3) + (x << 1) + (rr & 15); rr = getchar(); }
if (sgn) x = -x;
}
inline bool intersect(int i, int j) {
long long dx = X[i] - X[j], dy = Y[i] - Y[j], r = R[i] + R[j];
return dx * dx + dy * dy <= r * r;
}
inline void chk(int cand) {
int &t = ans[cur];
if (R[cand] < R[t] || (R[cand] == R[t] && cand > t)) return;
if (intersect(cur, cand)) t = cand;
}
struct SegTree {
struct Node {
set<pii> s;
};
int n, base;
vector<Node> T;
vector<int> L;
SegTree(int _n) : n(_n) {
for (base = 1; base < n; base <<= 1);
T.resize(base + base);
L.resize(base + base);
for (int i = base; i < base + base; i++) L[i] = i - base + 1;
for (int i = base - 1; i >= 1; i--) L[i] = L[i << 1];
}
inline void chk_node(int idx, int y, int r) {
auto it = T[idx].s.lower_bound({y, 0});
auto tmp = it;
if (it != T[idx].s.end()) {
chk(it->second);
if (it->first - y < r) {
++it;
if (it != T[idx].s.end()) chk(it->second);
}
}
// for (int i = 0; i < K; i++) {
// if (it == T[idx].end()) break;
// if (XL[it->second] <= li) break;
// chk(it->second);
// if (it->first >= (long long)y + r + r) break;
// if (i < K - 1) it++;
// }
it = tmp;
if (it != T[idx].s.begin()) {
--it;
chk(it->second);
if (it->first - y > -r && it != T[idx].s.begin()) {
chk(prev(it)->second);
}
}
// for (int i = 0; i < K; i++) {
// if (it == T[idx].begin()) break;
// it--;
// if (XL[it->second] <= li) break;
// chk(it->second);
// if (it->first <= (long long)y - r - r) break;
// }
}
void upd(int p, int q, pii x) {
p += base; q += base;
p--; q--;
while (p <= q) {
if (p & 1) T[p++].s.insert(x);
if (~q & 1) T[q--].s.insert(x);
p >>= 1; q >>= 1;
}
}
void get(int p, int y, int r, int li) {
p += base; p--;
while (p >= 1) {
if (L[p] <= li) break;
chk_node(p, y, r << 1);
p >>= 1;
}
}
};
int main() {
rf(N);
vector<int> vx, vy;
for (int i = 1; i <= N; i++) {
rf(X[i]); rf(Y[i]); rf(R[i]);
vx.push_back(X[i] - R[i]); vx.push_back(X[i] + R[i]);
vy.push_back(Y[i] - R[i]); vy.push_back(Y[i] + R[i]);
}
sort(vx.begin(), vx.end());
vx.erase(unique(vx.begin(), vx.end()), vx.end());
sort(vy.begin(), vy.end());
vy.erase(unique(vy.begin(), vy.end()), vy.end());
vector<int> v;
if (vx.size() < vy.size()) {
for (int i = 1; i <= N; i++) swap(X[i], Y[i]);
v = vy;
} else {
v = vx;
}
for (int i = 1; i <= N; i++) {
XL[i] = lower_bound(v.begin(), v.end(), X[i] - R[i]) - v.begin() + 1;
XR[i] = lower_bound(v.begin(), v.end(), X[i] + R[i]) - v.begin() + 1;
}
int M = v.size();
SegTree seg(M);
vector<int> idx(N);
iota(idx.begin(), idx.end(), 1);
sort(idx.begin(), idx.end(), [&](int a, int b) {
return pii(R[a], -a) > pii(R[b], -b);
});
for (int i : idx) {
cur = i;
ans[i] = i;
seg.get(XL[i], Y[i], R[i], 0);
seg.get(XR[i], Y[i], R[i], XL[i]);
if (ans[i] == i) seg.upd(XL[i], XR[i], {Y[i], i});
}
for (int i = 1; i <= N; i++) printf("%d ", ans[i]); puts("");
return 0;
}
