#include <bits/stdc++.h>
using namespace std;
#define int long long
int k[200010];
struct node {
	int g, s, b, id;
} a[200010];
inline bool cmp(node a, node b) {
	return a.g > b.g;
}
inline bool cmp2(node a, node b) {
	return a.s > b.s;
}
inline bool cmp3(node a, node b) {
	return a.b > b.b;
}
signed main() {
	ios::sync_with_stdio(false);
	ios_base::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++)
		cin >> a[i].g >> a[i].s >> a[i].b, a[i].id = i, k[i] = 1e18;
	sort(a + 1, a + 1 + n, cmp);
	int paiming = 1, people = 0;
	for (int i = 1; i <= n; i++) {
		if (a[i].g != a[i - 1].g) {
			paiming += people;
		}
		k[a[i].id] = min(k[a[i].id], paiming);
		people++;
	}
	sort(a + 1, a + 1 + n, cmp2);
	paiming = 1, people = 0;
	for (int i = 1; i <= n; i++) {
		if (a[i].s != a[i - 1].s) {
			paiming += people;
		}
		k[a[i].id] = min(k[a[i].id], paiming);
		people++;
	}
	sort(a + 1, a + 1 + n, cmp3);
	paiming = 1, people = 0;
	for (int i = 1; i <= n; i++) {
		if (a[i].b != a[i - 1].b) {
			paiming += people;
		}
		k[a[i].id] = min(k[a[i].id], paiming);
		people++;
	}
	for (int i = 1; i <= n; i++)
		cout << k[i] << endl;
	return 0;
}