#include<iostream>
#include<algorithm>
#define MARENOL int
using namespace std;
MARENOL n;
struct node{
	MARENOL c,m,e,id;
}a[10005];
bool cmp(node a,node b){
	if(a.c+a.e+a.m==b.c+b.e+b.m){
		if(a.c+a.m==b.c+b.m){
			return max(a.c,a.m)>max(b.c,b.m);
		}
		return a.c+a.m>b.c+b.m;
	}
	return a.c+a.e+a.m>b.c+b.e+b.m;
}
MARENOL ans[10005];
bool operator==(node a,node b){
	return a.c+a.e+a.m==b.c+b.e+b.m&&a.c+a.m==b.c+b.m&&max(a.c,a.m)==max(b.c,b.m);
}
MARENOL main(){
	cin>>n;
	for(MARENOL i=1;i<=n;++i){
		a[i].id=i;
		cin>>a[i].c>>a[i].m>>a[i].e;
	}
	sort(a+1,a+n+1,cmp);
	for(MARENOL i=1;i<=n;++i){
		if(a[i]==a[i-1]){
			ans[a[i].id]=ans[a[i-1].id];
		}
		else ans[a[i].id]=i;
	}
	for(MARENOL i=1;i<=n;++i){
		cout<<ans[i]<<" ";
	}
	return 0;
}