#include <algorithm>
#include <cstdio>
#include <vector>
using ll = long long;
inline ll sqr(int x) { return (ll)x * x; }
struct circle { int x, y, r; } arr[300005], seq[300005];
inline bool operator <(const circle &a, const circle &b) { return a.x < b.x || (a.x == b.x && a.y < b.y); }
inline bool operator !=(const circle &a, const circle &b) { return a < b || b < a; }
inline bool operator ==(const circle &a, const circle &b) { return !(a != b); }
inline bool inter(circle a, circle b) { return sqr(a.x - b.x) + sqr(a.y - b.y) <= sqr(a.r + b.r); }
int ans[300005], ord[300005], n, blk, len;
std::vector<int> vec[300005];
void resize(int sz)
{
if (blk && blk / 2 < sz)
return;
blk = sz;
int cnt = 0;
for (int i = 0; i < n; i++)
{
if (-1 == ans[i])
seq[cnt++] = {arr[i].x / blk, arr[i].y / blk, i};
}
std::sort(seq, seq + cnt);
len = 0;
for (int i = 0, j = 0; i < cnt; i = j)
{
while (j < cnt && seq[i] == seq[j])
j++;
vec[len].clear();
for (int k = i; k < j; k++)
vec[len].push_back(seq[k].r);
seq[len++] = seq[i];
}
}
int main()
{
// freopen("uoj-415.in", "r", stdin);
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%d%d%d", &arr[i].x, &arr[i].y, &arr[i].r);
arr[i].x += 1e9;
arr[i].y += 1e9;
ord[i] = i;
ans[i] = -1;
}
std::sort(ord, ord + n, [&] (int x, int y) { return arr[x].r > arr[y].r || (arr[x].r == arr[y].r && x < y); });
for (int t = 0; t < n; t++)
{
int u = ord[t];
if (~ans[u])
continue;
resize(arr[u].r * 2);
int x = arr[u].x / blk, y = arr[u].y / blk;
for (int i = x - 1; i <= x + 1; i++)
{
for (int j = y - 1; j <= y + 1; j++)
{
circle cur = {i, j, -1};
int res = std::lower_bound(seq, seq + len, cur) - seq;
if (res >= len || seq[res] != cur)
continue;
std::vector<int> rem;
for (int v : vec[res])
{
if (inter(arr[u], arr[v]))
ans[v] = u;
else
rem.push_back(v);
}
std::swap(vec[res], rem);
}
}
}
for (int i = 0; i < n; i++)
printf("%d%c", ans[i] + 1, " \n"[i + 1 == n]);
return 0;
}
