#include<bits/stdc++.h>
using ll=long long;
#define endl '\n'
using namespace std;
struct node{
	int ch,ma,en,sum,ip,pm;
}a[10010];
bool cmp(node a,node b){
	if(a.sum!=b.sum){
		return a.sum>b.sum;
	}
	if(a.ch+a.ma!=a.ch+b.ma){
		return a.ch+a.ma>b.ch+b.ma;
	}
	if(max(a.ch,a.ma)!=max(b.ch,b.ma)){
		return max(a.ch,a.ma)>max(b.ch,b.ma);
	}
	return false;
}
bool cmp2(node a,node b){
	return a.ip<b.ip;
}
int main(){
	cin.sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].ch>>a[i].ma>>a[i].en;
		a[i].ip=i;
		a[i].sum=a[i].ch+a[i].ma>>a[i].en;
	}
	sort(a+1,a+1+n,cmp);
	int last=1;
	for(int i=1;i<=n;i++){
		if(a[i].sum==a[i-1].sum&&a[i].ch+a[i].ma==a[i-1].ch+a[i-1].ma&&max(a[i].ch,a[i].ma)==max(a[i-1].ch,a[i-1].ma)){
			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;
}

求大佬帮我检查下问题