#include<bits/stdc++.h>
#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
#pragma comment(linker, "/stack:200000000")
//01001101 01100001 01101011 01101000 01100001 01100111 01100001 01111001
using namespace std;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()
#define ld double
#define ull unsigned long long
#define ff first
#define ss second
#define fix fixed << setprecision
#define pii pair<int, int>
#define E exit (0)
#define int long long
const int inf = 1e15, N = 1e6, mod = 998244353;
double eps = 1e-6;
vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
double dst(double x1, double y1, double x2, double y2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
main() {
//freopen("F.in", "r", stdin);
//freopen("F.out", "w", stdout);
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
int n;
cin >> n;
if (n <= 5000) {
vector<pair<pii, pii>> s;
for (int i = 1, x, y, r; i <= n; i++) {
cin >> x >> y >> r;
s.pb({{inf - r, i}, {x, y}});
}
int ans[n + 1];
vector<int> was(n + 1);
sort(all(s));
for (auto x: s) {
if (was[x.ff.ss]) continue;
was[x.ff.ss] = 1;
ans[x.ff.ss] = x.ff.ss;
for (auto y: s) {
if (was[y.ff.ss]) continue;
if (dst(x.ss.ff, x.ss.ss, y.ss.ff, y.ss.ss) - double(inf * 2 - x.ff.ff - y.ff.ff) <= eps) {
ans[y.ff.ss] = x.ff.ss;
was[y.ff.ss] = 1;
}
}
}
for (int i = 1; i <= n; i++) cout << ans[i] << ' ';
}else {
vector<pii> s, h, lg, rg;
int x[n + 1], y[n + 1], r[n + 1];
int tl[n + 1], tr[n + 1];
vector<int> ans(n + 1);
set<int> t;
for (int i = 1; i <= n; i++) {
cin >> x[i] >> y[i] >> r[i];
s.pb({x[i] - r[i], i});
s.pb({x[i] + r[i], i});
lg.pb({x[i] - r[i], i});
rg.pb({x[i] + r[i], i});
h.pb({inf - r[i], i});
}
for (int i = 0; i < n * 2; i++) t.insert(i);
sort(all(h));
sort(all(s));
sort(all(lg));
sort(rall(rg));
int l = 0;
for (auto e: lg) {
while (l < n * 2 && s[l].ff < e.ff) l++;
tl[e.ss] = l;
}
reverse(all(s));
l = 0;
for (auto e: rg) {
while (l < n * 2 && s[l].ff > e.ff) l++;
tr[e.ss] = n * 2 - l - 1;
}
reverse(all(s));
for (auto e: h) {
auto it = t.lower_bound(tl[e.ss]);
vector<int> cur;
while (it != t.end() && *it <= tr[e.ss]) {
if (!ans[s[*it].ss]) ans[s[*it].ss] = e.ss;
cur.pb(*it);
it++;
}
for (auto e: cur) t.erase(e);
}
for (int i = 1; i <= n; i++) cout << ans[i] << ' ';
}
}
