#include <stdio.h>
#include <string.h>
#define N 300000
#define X 1000000000
unsigned int Z = 12345;
int rand_() {
return (Z *= 3) >> 1;
}
int xx[N], yy[N], rr_[N], yy_[N * 2];
int intersect(int i, int j) {
long long x = xx[i] - xx[j], y = yy[i] - yy[j], r = rr_[i] + rr_[j];
return x * x + y * y <= r * r;
}
int compare_r(int i, int j) {
return rr_[i] != rr_[j] ? rr_[j] - rr_[i] : i - j;
}
int compare_y(int i, int j) {
return yy_[i] == yy_[j] ? (i & 1) - (j & 1) : (yy_[i] < yy_[j] ? -1 : 1);
}
int (*compare)(int, int);
void sort(int *ii, int l, int r) {
while (l < r) {
int i = l, j = l, k = r, i_ = ii[l + rand_() % (r - l)], tmp;
while (j < k) {
int c = compare(ii[j], i_);
if (c == 0)
j++;
else if (c < 0) {
tmp = ii[i], ii[i] = ii[j], ii[j] = tmp;
i++, j++;
} else {
k--;
tmp = ii[j], ii[j] = ii[k], ii[k] = tmp;
}
}
sort(ii, l, i);
l = k;
}
}
int zz[1 + N], ll[1 + N], rr[1 + N], ii1[1 + N], u_, l_, r_;
int node(int i) {
static int _ = 1;
zz[_] = rand_();
ii1[_] = i;
return _++;
}
void split(int u, int i) {
int c;
if (u == 0) {
u_ = l_ = r_ = 0;
return;
}
c = xx[ii1[u]] != xx[i] ? xx[ii1[u]] - xx[i] : ii1[u] - i;
if (c < 0) {
split(rr[u], i);
rr[u] = l_, l_ = u;
} else if (c > 0) {
split(ll[u], i);
ll[u] = r_, r_ = u;
} else {
u_ = u, l_ = ll[u], r_ = rr[u];
ll[u] = rr[u] = 0;
}
}
int merge(int u, int v) {
if (u == 0)
return v;
if (v == 0)
return u;
if (zz[u] < zz[v]) {
rr[u] = merge(rr[u], v);
return u;
} else {
ll[v] = merge(u, ll[v]);
return v;
}
}
int first(int u) {
return ll[u] == 0 ? u : first(ll[u]);
}
int last(int u) {
return rr[u] == 0 ? u : last(rr[u]);
}
int remove_first(int u) {
if (ll[u] == 0)
return rr[u];
ll[u] = remove_first(ll[u]);
return u;
}
int remove_last(int u) {
if (rr[u] == 0)
return ll[u];
rr[u] = remove_last(rr[u]);
return u;
}
int ii_[N], n, lg;
int idx(int x, int y) {
int lower = -1, upper = n;
while (upper - lower > 1) {
int i = (lower + upper) / 2, x_ = xx[ii_[i]] >> lg + 1, y_ = yy[ii_[i]] >> lg + 1;
if (x_ < x || x_ == x && y_ <= y)
lower = i;
else
upper = i;
}
return lower != -1 && xx[ii_[lower]] >> lg + 1 == x && yy[ii_[lower]] >> lg + 1 == y ? lower : -1;
}
int main() {
static char root[N];
static int iii[N][4], kk[N], ii[N * 2], tmp[N], pp[N];
static char used[N];
int n, g, h, h_, i, j, segs, same, cnt;
scanf("%d", &n);
segs = 1, same = 1;
for (i = 0; i < n; i++) {
scanf("%d%d%d", &xx[i], &yy[i], &rr_[i]);
if (yy[i] != 0)
segs = 0;
if (rr_[i] != rr_[0])
same = 0;
}
if (n <= 5000) {
while (1) {
int i_;
i_ = -1;
for (i = 0; i < n; i++)
if (!used[i] && (i_ == -1 || rr_[i_] < rr_[i]))
i_ = i;
if (i_ == -1)
break;
for (i = 0; i < n; i++)
if (!used[i] && intersect(i_, i))
used[i] = 1, pp[i] = i_;
}
} else if (segs) {
for (i = 0; i < n; i++)
ii[i] = i;
compare = compare_r, sort(ii, 0, n);
for (h = 0; h < n; h++) {
int i = ii[h], p, q;
split(u_, i);
p = l_ ? ii1[last(l_)] : -1, q = r_ ? ii1[first(r_)] : -1;
if (p != -1 && xx[p] + rr_[p] < xx[i] - rr_[i])
p = -1;
if (q != -1 && xx[q] - rr_[q] > xx[i] + rr_[i])
q = -1;
if (p == -1 && q == -1)
pp[i] = i, u_ = node(i);
else
pp[i] = q == -1 || p != -1 && (rr_[p] > rr_[q] || rr_[p] == rr_[q] && p < q) ? p : q;
u_ = merge(merge(l_, u_), r_);
}
} else if (same) {
for (i = 0; i < n; i++) {
xx[i] += X, yy[i] += X;
ii[i] = ii_[i] = i;
}
compare = compare_r, sort(ii, 0, n);
for (lg = 30, h = 0; lg >= 0; lg--) {
memset(kk, 0, n * sizeof *kk);
for (i = n - 1, j = n - 1; i >= 0; i--) {
if (xx[ii_[i]] >> lg + 1 != xx[ii_[j]] >> lg + 1 || yy[ii_[i]] >> lg + 1 != yy[ii_[j]] >> lg + 1)
j = i;
if (root[ii_[i]])
iii[j][kk[j]++] = ii_[i];
}
while (h < n && rr_[ii[h]] >= 1 << lg) {
int i_ = ii[h], x = xx[i_] >> lg + 1, y = yy[i_] >> lg + 1, dx, dy, p;
p = -1;
for (dx = -2; dx <= 2; dx++)
for (dy = -2; dy <= 2; dy++) {
g = idx(x + dx, y + dy);
for (h_ = 0; h_ < kk[g]; h_++) {
int j_ = iii[g][h_];
if (intersect(i_, j_) && (p == -1 || rr_[p] < rr_[j_] || rr_[p] == rr_[j_] && p > j_))
p = j_;
}
}
if (p != -1)
pp[i_] = p;
else {
pp[i_] = i_, root[i_] = 1;
g = idx(x, y);
iii[g][kk[g]++] = i_;
}
h++;
}
for (i = 0; i < n; i = j) {
int x = xx[ii_[i]] >> lg + 1;
j = i + 1;
while (j < n && (xx[ii_[j]] >> lg + 1) == x)
j++;
cnt = 0;
for (h_ = i; h_ < j; h_++)
if ((xx[ii_[h_]] >> lg & 1) == 0)
ii_[i++] = ii_[h_];
else
tmp[cnt++] = ii_[h_];
memcpy(ii_ + i, tmp, cnt * sizeof *tmp);
}
for (i = 0; i < n; i = j) {
int x = xx[ii_[i]] >> lg, y = yy[ii_[i]] >> lg + 1;
j = i + 1;
while (j < n && (xx[ii_[j]] >> lg) == x && (yy[ii_[j]] >> lg + 1) == y)
j++;
cnt = 0;
for (h_ = i; h_ < j; h_++)
if ((yy[ii_[h_]] >> lg & 1) == 0)
ii_[i++] = ii_[h_];
else
tmp[cnt++] = ii_[h_];
memcpy(ii_ + i, tmp, cnt * sizeof *tmp);
}
}
} else {
for (i = 0; i < n; i++)
yy_[i << 1 | 0] = yy[i] - rr_[i], yy_[i << 1 | 1] = yy[i] + rr_[i];
for (i = 0; i < n * 2; i++)
ii[i] = i;
compare = compare_y, sort(ii, 0, n * 2);
for (i = 0; i < n; i++)
pp[i] = i;
for (h = 0; h < n * 2; h++) {
int i_ = ii[h], p, q;
i = i_ >> 1;
if ((i_ & 1) == 0) {
split(u_, i);
p = l_ ? ii_[last(l_)] : -1, q = r_ ? ii_[first(r_)] : -1;
if (p != -1 && intersect(p, i))
l_ = remove_last(l_), pp[i] = pp[p] = p == -1 || i != -1 && (rr_[i] > rr_[p] || rr_[i] == rr_[p] && i < p) ? i : p;
else if (q != -1 && intersect(q, i))
r_ = remove_first(r_), pp[i] = pp[q] = q == -1 || i != -1 && (rr_[i] > rr_[q] || rr_[i] == rr_[q] && i < q) ? i : q;
else
u_ = node(i);
u_ = merge(merge(l_, u_), r_);
} else {
split(u_, i);
p = l_ ? ii_[last(l_)] : -1, q = r_ ? ii_[first(r_)] : -1;
if (p != -1 && q != -1 && intersect(p, q))
l_ = remove_last(l_), r_ = remove_first(r_), pp[p] = pp[q] = q == -1 || p != -1 && (rr_[p] > rr_[q] || rr_[p] == rr_[q] && p < q) ? p : q;
u_ = merge(l_, r_);
}
}
}
for (i = 0; i < n; i++)
printf("%d ", pp[i] + 1);
printf("\n");
return 0;
}
