#include "bits/stdc++.h"
using namespace std;
const int MAXN = 3e5+5;
vector< pair < pair<int, int>, pair<int, int> > > circles;
vector<int> ans(MAXN, 0);
bool cmp(pair < pair<int, int>, pair<int, int> > &a, pair < pair<int, int>, pair<int, int> > &b)
{
if(a.second.first != b.second.first)
return a.second.first > b.second.first;
return a.second.second < b.second.second;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int maxy = -1e9;
for(int i = 0; i < n; i++)
{
int x = i + 1, y = 0, r = 1000;
cin >> x >> y >> r;
maxy = max(maxy, y);
circles.push_back({{x, y}, {r, i}});
}
sort(circles.begin(), circles.end(), cmp);
//cout << "s\n";
if(n <= 5e3 && maxy != 0)
{
for(int i = 0; i < n; i++)
{
if(ans[circles[i].second.second] != 0)
continue;
//cout << circles[i].second.second << "\n";
ans[circles[i].second.second] = circles[i].second.second + 1;
for(int a = 0; a < n; a++)
{
if(ans[circles[a].second.second] == 0)
{
long double dist = sqrt(pow(abs(circles[i].first.first - circles[a].first.first), 2) + pow(abs(circles[i].first.second - circles[a].first.second), 2));
if(dist <= circles[i].second.first + circles[a].second.first)
ans[circles[a].second.second] = circles[i].second.second + 1;
}
}
}
} else
{
multiset< pair<int, int> > elems;
for(int i = 0; i < n; i++)
{
elems.insert({circles[i].first.first, circles[i].second.second});
}
for(int i = 0; i < n; i++)
{
if(ans[circles[i].second.second] != 0)
continue;
//cout << circles[i].second.second << "\n";
auto it = elems.find({circles[i].first.first, circles[i].second.second});
auto prev = it;
vector<int> toerase;
if(it != elems.begin()) {
it--;
while(true)
{
pair<int, int> temp = (*it);
if(abs(circles[i].first.first - temp.first) <= circles[i].second.first + circles[temp.second].second.first)
{
toerase.push_back(temp.second);
} else
break;
if(it == elems.begin())
break;
it--;
}
}
it = prev;
while(it != elems.end())
{
pair<int, int> temp = (*it);
if(abs(circles[i].first.first - temp.first) <= circles[i].second.first + circles[temp.second].second.first)
{
toerase.push_back(temp.second);
} else
break;
it++;
}
for(int e : toerase)
{
ans[circles[e].second.second] = circles[i].second.second + 1;
elems.erase({circles[e].first.first, circles[e].second.second});
}
}
}
for(int i = 0; i < n; i++)
cout << ans[i] << " ";
cout << "\n";
}
