#include<bits/stdc++.h>
#define ll long long
using namespace std;
struct stu{
int c,m,e;
int sum,t;
int pm;
}a[105];
int n;
void pd(int x,int w)
{
if(a[w-1].sum<a[w].sum)
{
a[w].pm=a[w-1].pm;
a[w-1].pm=x;
}
else if(a[w-1].c+a[w-1].m<a[w].c+a[w].m)
{
a[w].pm=a[w-1].pm;
a[w-1].pm=x;
}
else if(max(a[w-1].c,a[w-1].m)<max(a[w].c,a[w].m))
{
a[w].pm=a[w-1].pm;
a[w-1].pm=x;
}
else if(a[w-1].sum>a[w].sum) a[w].pm=x;
else if(a[w-1].c+a[w-1].m>a[w].c+a[w].m) a[w].pm=x;
else if(max(a[w-1].c,a[w-1].m)>max(a[w].c,a[w].m)) a[w].pm=x;
else a[w].pm=a[w-1].pm;
pd(x+1,w+1);
}
int main()
{
cin>>n;
a[0].pm=1;
for(int i=1;i<=n;i++)
{
cin>>a[i].c>>a[i].m>>a[i].e;
a[i].sum=a[i].c+a[i].m+a[i].e;
a[i].t=i;
}
pd(1,1);
for(int i=1;i<=n;i++)
cout<<a[i].pm<<endl;
return 0;
}