#include<bits/stdc++.h>
using namespace std;
int g[200005],s[200005],b[200005],g2[200005],s2[200005],b2[200005],n;
int f(int x,int key){
	int ans;
	if(x==1){
		int l=0,r=n,m;
		while(r-l>1){
			m=(l+r)/2;
			if(g2[m]>key){
				r=m-1;
			}else l=m;
		}
		ans=l;
	}else if(x==2){
		int l=0,r=n,m;
		while(r-l>1){
			m=(l+r)/2;
			if(s2[m]>key){
				r=m-1;
			}else l=m;
		}
		ans=l;
	}else if(x==3){
		int l=0,r=n,m;
		while(r-l>1){
			m=(l+r)/2;
			if(b2[m]>key){
				r=m-1;
			}else l=m;
		}
		ans=l;
	}
	return n-ans+1;
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>g[i]>>s[i]>>b[i];
		g2[i]=g[i];
		s2[i]=s[i];
		b2[i]=b[i]; 
	}
	sort(g2+1,g2+1+n);
	sort(s2+1,s2+1+n);
	sort(b2+1,b2+1+n);
	for(int i=1;i<=n;i++){
		int a=min(f(1,g[i]),min(f(2,s[i]),f(3,b[i])));
		cout<<a<<endl;
	}
	return 0;
}