#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 6;
long long g[N], s[N], b[N];
int n, id[N], g1[N], s1[N], b1[N];
int cmp(int x, int y) {
	return x >= y;
}
int main() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		id[i] = i;
		cin >> g[i] >> s[i] >> b[i];
		g1[i] = g[i];
		s1[i] = s[i];
		b1[i] = b[i];
	}
	sort(g1 + 1, g1 + 1 + n, cmp);
	sort(s1 + 1, s1 + 1 + n, cmp);
	sort(b1 + 1, b1 + 1 + n, cmp);
	/*	for(int i=1;i<=n;i++){
		cout<<g1[i]<<" ";
		}
		cout<<endl;
		for(int i=1;i<=n;i++){
		cout<<s1[i]<<" ";
		}
		cout<<endl;
		for(int i=1;i<=n;i++){
		cout<<b1[i]<<" ";
		}
	*/	for (int i = 1; i <= n; i++) {

			int p1=INT_MAX, p2=INT_MAX, p3=INT_MAX;
			for (int j = 1; j <= n; j++) {
				if (g[i] == g1[j]) {
					p1=j;
					break;
				}

			}
			for (int j = 1; j <= n; j++) {
				if (s[i] == s1[j]) {
					p2=j;
					break;
				}
			}
			for (int j = 1; j <= n; j++) {
				if (b[i] == b1[j]) {
					p3=j;
					break;
				}
					}
			int ans ;
			ans= min(p1,p2);
			ans=min(ans,p3);
			cout<<ans<<endl;

				
	}
	return 0;
}