#define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}
// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
public:
template<typename T>
_Debug& operator,(T val) {
cout << val << endl;
return *this;
}
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif
// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back
// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;
// ---------- END OF TEMPLATE ----------
int x[300000],y[300000],r[300000],o[300000];
bool comp(int a,int b) {
if (r[a] == r[b]) return a < b;
else return r[a] > r[b];
}
LLI sq(LLI n) { return n*n; }
int inter(int a,int b) {
return (sq(x[a]-x[b])+sq(y[a]-y[b])) <= sq(r[a]+r[b]);
}
vpii v;
vector<vi> v2;
int ans[300000];
int main() {
int i;
int n;
scanf("%d",&n);
for (i = 0; i < n; i++) scanf("%d %d %d",&x[i],&y[i],&r[i]),o[i] = i;
sort(o,o+n,comp);
int j,k,l;
int logbs = 30;
fill(ans,ans+n,-1);
v.pb(mp(0,0)),v2.pb(vi());
for (i = 0; i < n; i++) v2[0].pb(i);
for (i = 0; i < n; i++) {
if (ans[o[i]] == -1) {
if (r[o[i]] <= (1 << (logbs-1))) {
while (r[o[i]] <= (1 << (logbs-1))) logbs--;
v.clear(),v2.clear();
for (j = i; j < n; j++) {
if (ans[o[j]] == -1) v.pb(mp(x[o[j]] >> logbs,y[o[j]] >> logbs));
}
sort(v.begin(),v.end());
v.resize(unique(v.begin(),v.end())-v.begin());
v2.resize(v.size());
for (j = i; j < n; j++) {
if (ans[o[j]] == -1) v2[lower_bound(v.begin(),v.end(),mp(x[o[j]] >> logbs,y[o[j]] >> logbs))-v.begin()].pb(o[j]);
}
}
for (j = (x[o[i]] >> logbs)-2; j <= (x[o[i]] >> logbs)+2; j++) {
for (k = (y[o[i]] >> logbs)-2; k <= (y[o[i]] >> logbs)+2; k++) {
int p = lower_bound(v.begin(),v.end(),mp(j,k))-v.begin();
if ((p < v.size()) && (v[p] == mp(j,k))) {
vi temp;
for (l = 0; l < v2[p].size(); l++) {
if (inter(o[i],v2[p][l])) ans[v2[p][l]] = o[i];
else temp.pb(v2[p][l]);
}
v2[p] = temp;
}
}
}
}
}
for (i = 0; i < n; i++) printf("%d ",ans[i]+1);
return 0;
}
