#include<bits/stdc++.h>
using namespace std;
const int maxn=200005;
int n,a[maxn],b[maxn],c[maxn],sa[maxn],sb[maxn],sc[maxn];
signed main(){
//	freopen("medal3.in","r",stdin);
//	freopen("out.txt","w",stdout);
	cin>>n;
	for (int i=1;i<=n;cin>>a[i]>>b[i]>>c[i],sa[i]=a[i],sb[i]=b[i],sc[i]=c[i],i++);
	sort(sa+1,sa+n+1);
	sort(sb+1,sb+n+1);
	sort(sc+1,sc+n+1);
	for (int i=1;i<=n;i++){
		auto ita=upper_bound(sa+1,sa+n+1,a[i]),
		itb=upper_bound(sb+1,sb+n+1,b[i]),
		itc=upper_bound(sc+1,sc+n+1,c[i]);
		ita--,itb--,itc--;
		int da=distance(a,ita)-600048,
		db=distance(b,itb)-600048,
		dc=distance(c,itc)-600048;
		cout<<n-max(da,max(db,dc))+1<<'\n';
	}
	return 0;
}