#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 1e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }
#define int long long
#define sqr(x) ((x)*1ll*(x))
struct cir { int x, y, r, id; };
inline int ds(const cir &a, const cir &b) { return sqr(a.x-b.x)+sqr(a.y-b.y); }
inline bool isec(const cir &a, const cir &b) { return ds(a, b) <= sqr(a.r + b.r); }
inline bool operator < (const cir &a, const cir &b) {
if (a.r != b.r) return a.r > b.r;
else if (a.id != b.id) return a.id < b.id;
else if (a.x != b.x) return a.x < b.x;
else return a.y < b.y;
}
inline void solve() {
int n;
cin >> n;
set<cir> st;
for (int i = 0; i < n; ++i) {
int x, y, r;
cin >> x >> y >> r;
st.insert({x, y, r, i});
}
ve<int> ans(n);
while (sz(st)) {
cir f = *st.begin();
st.erase(st.begin());
ans[f.id] = f.id;
ve<cir> bad;
for (auto &c : st) {
if (isec(f, c)) {
ans[c.id] = f.id;
bad.pb(c);
}
}
for (auto x : bad) st.erase(x);
}
for (auto i : ans) cout << i + 1 << " ";
}
signed main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int q = 1; // cin >> q;
while (q--) solve();
cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}
