#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

int main()
{
    int n;
    cin >> n;

    vector<vector<ll>> abcde(5, vector<ll>(n));
    for (int j = 0; j < n; j++)
    {
        for (int i = 0; i < 5; i++)
        {
            cin >> abcde[i][j];
        }
    }
    
    vector<ll> ans(n, 0);
    for (int s = 0; s < (1<<5); s++)
    {
        vector<ll> pattern(n, 0LL);
        ll maxi = -1e18, mini = 1e18;
        for (int j = 0; j < n; j++)
        {
            for (int i = 0; i < 5; i++)
            {
                if ((s>>i)&1) pattern[j] -= abcde[i][j];
                else pattern[j] += abcde[i][j];
            }
            maxi = max(maxi, pattern[j]);
            mini = min(mini, pattern[j]);
        }

        for (int j = 0; j < n; j++)
        {
            ll ret1 = maxi - pattern[j];
            ll ret2 = pattern[j] - mini;
            ans[j] = max({ans[j], ret1, ret2});
        }
    }

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