#include<bits/stdc++.h>
using namespace std;
const int N=5e6+5;
int b[N];
struct node{
	int c,m,e,A,id;
}a[N];
bool cmp(node x,node y){
	if(x.A!=y.A)return x.A>y.A;
	else if(x.c+x.m!=y.c+y.m)return x.c+x.m>y.c+y.m;
	else if(max(x.c,x.m)!=max(x.c,x.m))return max(x.c,x.m)>max(x.c,x.m);
	else return 0;
}
signed main(){
//	freopen("wrong.txt","w",stdout);
	ios::sync_with_stdio(0);
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].c>>a[i].m>>a[i].e;
		a[i].A=a[i].c+a[i].m+a[i].e;
		a[i].id=i;
	}
	sort(a+1,a+1+n,cmp);
	int last=1;
	for(int i=1;i<=n;i++){
		if(a[i].A!=a[i-1].A||a[i].c+a[i].m!=a[i-1].c+a[i-1].m||max(a[i].c,a[i].m)!=max(a[i-1].c,a[i-1].m))last=i;
		b[a[i].id]=last;
	}
	for(int i=1;i<=n;i++)cout<<b[i]<<endl;
	return 0;
}