/*
方針を聞いてAC
*/
#include<iostream>
#include<set>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<numeric>
#include<queue>
#include<cmath>
using namespace std;
typedef long long ll;
const ll INF=1LL<<60;
typedef pair<int,int> P;
typedef pair<int,P> PP;
const ll MOD=998244353;
const double PI=acos(-1);

int main(){
    int N;
    cin>>N;
    vector<vector<ll>> A(N,vector<ll>(5));
    for(int i=0;i<N;i++){
        for(int j=0;j<5;j++){
            cin>>A[i][j];
        }
    }

    vector<ll> ans(N);
    const int r=5;

    for(int S=0;S<(1<<r);S++){
        
        ll candmax=-INF,candmin=INF;
        vector<ll> F(N,0);
        for(int i=0;i<N;i++){
            for(int t=0;t<r;t++){
                if((S>>t)&1){
                    F[i]-=A[i][t];
                }else{
                    F[i]+=A[i][t];
                }
            }
            candmax=max(candmax,F[i]);
            candmin=max(candmin,F[i]);
        }

        for(int i=0;i<N;i++){
            ans[i]=max({ans[i],candmax-F[i],F[i]-candmin});
        }

    }

    for(int i=0;i<N;i++){
        cout<<ans[i]<<endl;
    }


  

}