#include <bits/stdc++.h>
#define rep(i, a, b) for (auto cc##i = (b), i = (a); i <= cc##i; ++i)
#define per(i, a, b) for (auto cc##i = (b), i = (a); i >= cc##i; --i)
using namespace std;
using LL = long long;

struct Circle {
  LL x, y, r;
};

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n;
  cin >> n;
  vector<Circle> a(n);
  for (auto &[x, y, r] : a) {
    cin >> x >> y >> r;
  }
  vector<int> px;
  for (auto &[x, y, r] : a) {
    px.push_back(x);
  }
  sort(px.begin(), px.end());
  px.erase(unique(px.begin(), px.end()), px.end());
  for (auto &[x, y, r] : a) {
    x = lower_bound(px.begin(), px.end(), x) - px.begin();
  }
  int m = px.size();
  vector<vector<pair<LL, int>>> b(m);
  rep(i, 0, n - 1) {
    b[a[i].x].push_back({a[i].y, i});
  }
  rep(i, 0, m - 1) {
    sort(b[i].begin(), b[i].end());
  }
  vector<int> del(n), ord(n);
  iota(ord.begin(), ord.end(), 0);
  sort(ord.begin(), ord.end(), [&](auto x, auto y) {
    if (a[x].r != a[y].r) return a[x].r > a[y].r;
    return x < y;
  });
  int cur = 0;
  vector<int> ans(n);
  auto pd = [&](int u, int v) {
    LL x = abs(px[a[u].x] - px[a[v].x]);
    LL y = abs(a[u].y - a[v].y);
    LL d = a[u].r + a[v].r;
    return x * x + y * y <= d * d;
  };
  while (cur < n) {
    int u = ord[cur];
    if (!del[u]) {
      LL d = a[u].r;
      LL lx = px[a[u].x] - d * 2, rx = px[a[u].x] + d * 2;
      LL ly = a[u].y - d * 2, ry = a[u].y + d * 2;
      int l = a[u].x, r = a[u].x + 1;
      while (~l && px[l] >= lx) {
        auto it = lower_bound(b[l].begin(), b[l].end(), make_pair(ly, 0));
        while (it != b[l].end() && it->first <= ry) {
          int now = it->second;
          if (!del[now] && pd(now, u)) {
            del[now] = 1;
            ans[now] = u;
          }
          it++;
        }
        l--;
      }
      while (r < m && px[r] <= rx) {
        auto it = lower_bound(b[r].begin(), b[r].end(), make_pair(ly, 0));
        while (it != b[r].end() && it->first <= ry) {
          int now = it->second;
          if (!del[now] && pd(now, u)) {
            del[now] = 1;
            ans[now] = u;
          }
          it++;
        }
        r++;
      }
    }
    cur++;
  }
  rep(i, 0, n - 1) {
    cout << ans[i] + 1 << " \n"[i == n - 1];
  }
  return 0;
}