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

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N;
    cin >> N;
    vector<array<ll, 5>> a(N);
    vector<ll> ans(N, -(1ll << 60));
    for(int i = 0; i < N; i++){
        for(int j = 0; j < 5; j++){
            cin >> a[i][j];
        }
    }
    for(int i = 0; i < 32; i++){
        vector<pair<ll,ll>> b(N);
        for(int j = 0; j < N; j++){
            ll x = 0, y = 0;
            for(int k = 0; k < 5; k++){
                if(i >> k & 1) x += a[j][k];
                else y += a[j][k];
            }
            b[j] = make_pair(x, y);
        }
        auto c = b;
        sort(c.begin(), c.end(), [&](pair<ll,ll> lhs, pair<ll,ll> rhs){
            return lhs.first + lhs.second < rhs.first + rhs.second;
        });
        ll mn = c[0].first + c[0].second, mx = c[N - 1].first + c[N - 1].second;
        for(int j = 0; j < N; j++){
            ll v = b[j].first + b[j].second;
            ans[j] = max(ans[j], abs(mn - v));
            ans[j] = max(ans[j], abs(mx - v));
        }
        sort(c.begin(), c.end(), [&](pair<ll,ll> lhs, pair<ll,ll> rhs){
            return lhs.first - lhs.second < rhs.first - rhs.second;
        });
        mn = c[0].first - c[0].second, mx = c[N - 1].first - c[N - 1].second;
        for(int j = 0; j < N; j++){
            ll v = b[j].first - b[j].second;
            ans[j] = max(ans[j], abs(mn - v));
            ans[j] = max(ans[j], abs(mx - v));
        }
    }
    for(int i = 0; i < N; i++) cout << ans[i] << '\n';
}