#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int n;
int t;
long long G,S,B;
vector<long long>g,g1,s,s1,b,b1;
long long max(long long g,long long s,long long b){
	long long temp=g;
	if(s<temp){
		temp=s;
	}
	if(b<temp){
		temp=b;
	};
	return temp;
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>g[i];
		cin>>s[i];
		cin>>b[i];
		g1[i]=g[i];
		s1[i]=s[i];
		b1[i]=b[i];
	}
	for(int i=1;i<=n;i++){
		sort(g1.begin(),g1.end());
		sort(s1.begin(),s1.end());
		sort(b1.begin(),b1.end());
		for(int j=1;j<=g.size();j++){
			if(g[i]>=g1[g1.size()-j+1]){
				G=j;
				break;
			}
		}
		for(int j=1;j<=s.size();j++){
			if(s[i]>=s1[s1.size()-j+1]){
				S=j;
				break;
			}
		}
		for(int j=1;j<=b.size();j++){
			if(b[i]>=b1[b1.size()-j+1]){
				B=j;
				break;
			}
		}
		cout<<max(G,S,B);
	}
}