#include<bits/stdc++.h>
using namespace std;
int n;
struct node{
	int c,m,e;
	int id,pm;
};
node a[1005];
bool cmp(node x,node y){
	int a=x.c+x.m+x.e,b=y.c+y.m+y.e;
	int c=x.c+x.m,d=y.c+y.m;
	int e1=max(x.c,x.m),f=max(y.c,y.m);
	if(a!=b) return a>b;
	else if(c!=d) return c>d;
	else if(e1!=f) return e1>f;
	return x.id<y.id;
}
bool cmp2(node x,node y){
	return x.id<y.id;
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].c>>a[i].m>>a[i].e;
		a[i].id=i;
	}
	sort(a+1,a+1+n,cmp);
	for(int i=1;i<=n;i++){
		if(max(a[i].c,a[i].m)==max(a[i-1].c,a[i-1].m)) a[i].pm=a[i-1].pm;
		else a[i].pm=i;
	}
	sort(a+1,a+1+n,cmp2);
	for(int i=1;i<=n;i++){
		cout<<a[i].pm<<endl;
	}
	return 0;
}