#include<bits/stdc++.h>
using namespace std;
struct node{
	int e,m,c,sum,pai,num;
};
vector<node> vc;
bool cmp(node x, node y) {
	if (x.sum != y.sum){
		return x.sum > y.sum;
	}	
	if (x.c + x.m != y.c + y.m){
		return x.c + x.m > y.c + y.m;
	}	
	if (max(x.c, x.m) != max(y.c, y.m)){
		return max(x.c, x.m) > max(y.c, y.m);
	}	
	return false;
}
bool cmp1(node x, node y) {
	return x.num < y.num;
}
int main(){
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		node x;
		cin>>x.c>>x.m>>x.e;
		x.num=i;
		x.sum = x.c + x.m + x.e;
		vc.push_back(x);
	}
	sort(vc.begin(),vc.end(),cmp);
	for(int i=1;i<=n;i++){
		if(vc[i].sum==vc[i-1].sum&&vc[i].c+vc[i].m==vc[i-1].c+vc[i-1].m&&max(vc[i].c,vc[i].m)==max(vc[i-1].c,vc[i-1].m)){
			vc[i].pai=vc[i-1].pai;
		}else{
			vc[i].pai=i;
		}
	}
	sort(vc.begin(),vc.end(),cmp1);
	for(int i=1;i<=n;i++){
		cout<<vc[i].pai<<endl;
	}
	return 0;
}