捞

#include<iostream>
#include<cstdio>
#include<cstring>
#include<map>
#include<cmath>
#include<queue>
#include<algorithm>
#include<vector>
using namespace std;
long long n;
struct jd
{
	long long chinese;
	long long math;
	long long english;
	long long answer;
	long long id;
};
long long cnt(jd b,jd c)
{
	if(b.answer!=c.answer)
	{
		return b.answer>c.answer;
	}
	else if((b.math+b.chinese)!=(c.math+c.chinese))
	{
		return (b.math+b.chinese)>(c.math+c.chinese);
	}
	else if(max(b.math,b.chinese)!=max(c.math,c.chinese))
	{
	   	return max(b.math,b.chinese)>max(c.math,c.chinese);
	}
	else 
	{
		return b.answer>c.answer;
	}
}
int main()
{
  cin>>n;
  jd a[110];
  for(int i=1;i<=n;i++)
  {
     cin>>a[i].chinese>>a[i].math>>a[i].english;
	 a[i].answer=a[i].chinese+a[i].math+a[i].english;	
  }
  sort(a+1,a+n+1,cnt);
  for(int i=1;i<=n;i++)
  {
  	if(a[i].answer==a[i-1].answer)
  	{
  		a[i].id=a[i-1].id;
  		continue;
	}
  	else
  	{
  		a[i].id=i; 
	}
  }
  for(int i=1;i<=n;i++)
  {
     cout<<a[i].id<<endl;
  }
  return 0;
}