#include <bits/stdc++.h>
using namespace std ;
#define fast_input_output ios::sync_with_stdio(false); cin.tie(nullptr);
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
typedef long long ll ;
typedef long double ld ;
typedef pair<ll,ll> P ;
typedef tuple<ll,ll,ll> TP ;
#define chmin(a,b) a = min(a,b)
#define chmax(a,b) a = max(a,b)
#define bit_count(x) __builtin_popcountll(x)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a / gcd(a,b) * b
#define rep(i,n) for(int i = 0 ; i < n ; i++)
#define rrep(i,a,b) for(int i = a ; i < b ; i++)
#define repi(it,S) for(auto it = S.begin() ; it != S.end() ; it++)
#define pt(a) cout << a << endl
#define DEBUG(...) ; cout << #__VA_ARGS__ << endl ; for(auto x : {__VA_ARGS__}) cout << x << "  " ; cout << endl ;
#define DEBUG_LIST(...) cout << #__VA_ARGS__ << endl ; DEBUG_REP(__VA_ARGS__) ;
#define DEBUG_REP(V) cout << "{ " ; repi(itr,V) cout << *itr << ", " ; cout << "}" << endl ;
#define debug(a) cout << #a << " " << a << endl
#define all(a) a.begin(), a.end()
#define endl "\n"

int n;

int main(){
    fast_input_output
    cin >> n;
    vector<vector<ll>>A(n,vector<ll>(5));
    rep(i,n)rep(j,5)cin>>A[i][j];
    vector<ll>res(n,0);
    rep(S,1<<5){
        vector<ll>X;
        rep(i,n){
            ll sum = 0;
            rep(j,5){
                if(S>>j&1)sum+=A[i][j];
                else sum-=A[i][j];
            }
            X.push_back(sum);
        }
        sort(all(X));
        rep(i,n){
            ll sum=0;
            rep(j,5){
                if(S>>j&1)sum+=A[i][j];
                else sum-=A[i][j];
            }
            chmax(res[i],max(abs(sum-X.at(0)),abs(sum-X.back())));
        }
    }
    rep(i,n)cout<<res[i]<<endl;
}