#include <bits/stdc++.h>
using namespace std;
const int MAX = 300300;
int n;
long long x[MAX];
long long y[MAX];
long long r[MAX];
bool Good(int i, int j) {
return (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]) <= (r[i] + r[j]) * (r[i] + r[j]);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> r[i];
}
vector<int> order(n);
iota(order.begin(), order.end(), 0);
sort(order.begin(), order.end(), [&](int i, int j) {
if (r[i] != r[j]) {
return r[i] > r[j];
} else {
return i < j;
}
});
vector<int> res(n);
iota(res.begin(), res.end(), 0);
for (int pw = 30; pw >= 0; pw--) {
int k = (1 << pw);
vector<tuple<long long, long long, int>> v;
for (int i = 0; i < n; i++) {
if (res[i] != i) {
continue;
}
v.emplace_back(x[i] / k, y[i] / k, i);
}
sort(v.begin(), v.end());
for (int i : order) {
if (res[i] != i || r[i] < (1 << (pw - 1)) || r[i] > k) {
continue;
}
long long new_x = x[i] / k;
long long new_y = y[i] / k;
for (int dx = -2; dx <= 2; dx++) {
int ptr = (int) (lower_bound(v.begin(), v.end(), make_tuple(new_x - dx, new_y - 2, -1)) - v.begin());
while (ptr < (int) v.size() && get<0>(v[ptr]) == new_x - dx && abs(new_y - get<1>(v[ptr])) <= 2) {
if (Good(i, get<2>(v[ptr]))) {
int idx = get<2>(v[ptr]);
if (res[idx] == idx) {
res[idx] = i;
}
}
ptr += 1;
}
}
}
}
for (int i = 0; i < n; i++) {
cout << res[i] + 1 << " ";
}
cout << '\n';
return 0;
}
