#include <bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int n,aaaa[1005];
struct node{
	int a,b,c;
	int kg=0,idx;
}aa[1005];
bool cmp(node &aaa,node &bbb){
	if (aaa.a+aaa.b+aaa.c!=bbb.a+bbb.b+bbb.c) return aaa.a+aaa.b+aaa.c>bbb.a+bbb.b+bbb.c;
	if (aaa.a+aaa.b!=bbb.a+bbb.b) return aaa.a+aaa.b>bbb.a+bbb.b;
	if (max(aaa.a,aaa.b)!=max(bbb.a,bbb.b)) return max(aaa.a,aaa.b)>max(bbb.a,bbb.b);
	aaa.kg=1;
	bbb.kg=1;
	return 1;
}
int main(){
	cin>>n;
	for (int i=0;i<n;i++){
		cin>>aa[i].a>>aa[i].b>>aa[i].c;
		aa[i].idx=i;
	}
	sort(aa,aa+n,cmp);
	int qm=1,qm2=1;
	for (int i=0;i<n;i++){
		if (aa[i].kg==1 && aa[i-1].kg==1){
			aaaa[aa[i].idx]=qm2;
		}else if(aa[i].kg==1 && aa[i-1].kg!=1){
			qm2=qm;
			aaaa[aa[i].idx]=qm2;
		}else{
			aaaa[aa[i].idx]=qm;
		}
		qm++;
	}
	for (int i=0;i<n;i++){
		cout<<aaaa[i]<<"\n";
	}
	return 0;
}