#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    ll N, M = 1<<5, mx;
    cin >> N;
    vector<ll> ans(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];
    }

    for (int i=0; i<M; i++){
        vector<ll> B(N);
        mx = -1e18;
        for (int j=0; j<N; j++){
            ll S=0;
            for (int k=0; k<5; k++){
                if (i & 1<<k) S += A[j][k];
                else S -= A[j][k];
            }
            B[j] = S;
            mx = max(S, mx);
        }
        for (int j=0; j<N; j++){
            ans[j] = max(ans[j], mx-B[j]);
        }
    }

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

    return 0;
}