#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
ld pie=3.141592653589793;
ll inf=144494;
ll mod=1000000007;
int main(){
    ll n;
    cin >> n;
    vector<ll>a(n),b(n),c(n),d(n),e(n);
    vector<vector<ll>>t(n,vector<ll>(5));
    for (ll i = 0; i < n; i++)
    {
        for (ll j = 0; j < 5; j++)
        {
            cin >> t[i][j];
        }
    }
    vector<vector<ll>>p(32);
    vector<ll>two(30,1);
    for (ll i = 0; i < 11; i++)
    {
        two[i+1]=two[i]*2;
    }
    
    for (ll i = 0; i < n; i++)
    {
        for (ll j = 0; j < 32; j++)
        {
            ll x=0;
            for (ll k = 0; k < 5; k++)
            {
                if (j&two[k])
                {
                    x+=t[i][k];
                }else{
                    x-=t[i][k];
                }
            }
            p[j].push_back(x);
        }
    }
    for (ll i = 0; i < 32; i++)
    {
        sort(p[i].begin(),p[i].end());
    }
    for (ll i = 0; i < n; i++)
    {
        ll ans=0;
        for (ll j = 0; j < 32; j++)
        {
            ll x=0;
            for (ll k = 0; k < 5; k++)
            {
                if (j&two[k])
                {
                    x+=t[i][k];
                }else{
                    x-=t[i][k];
                }
            }
            ll y=abs(x-p[j][0]);
            y=max(y,abs(x-p[j][p[j].size()-1]));
            ans=max(ans,y);
        }
        cout << ans << endl;
    }
}