#include<bits/stdc++.h>
using namespace std;
int n;
const int N = 1e4 + 911;
struct st{
	int c, m, e;
	int cm, maxcm, cme;
	int x;
} a[N];
int cmp(st x, st y) {
	return x.cme > y.cme || x.cme == y.cme && x.cm > y.cm || x.cme == y.cme && x.cm == y.cm && x.maxcm > y.maxcm ;
}
int tot = 0;
int main() {
	cin >> n;
	for(int i = 1; i <= n; i++) {
		cin >> a[i].c >> a[i].m >> a[i].e;
		a[i].cme = a[i].c + a[i].m + a[i].e;
		a[i].cm = a[i].c + a[i].m;
		a[i].maxcm = max(a[i].c, a[i].m);
		a[i].x = i;
	}
	sort(a + 1, a + n + 1, cmp);
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= n; j++) {
			if(a[j].x == i) {
				
				if(a[j].cme == a[j - 1].cme && a[j].cm == a[j - 1].cm && a[j].maxcm == a[j - 1].maxcm) cout << tot << endl;
				else {
					cout << j << endl;
					tot = j;
				}
				break;
			}
		}
	}
	return 0;
}