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

vector<ll> c(vector<ll> &p) {
    int k = p.size();
    vector<ll> res;
    for (int bit = 0; bit < (1 << k); bit++) {
        ll tmp = 0;
        for (int i = 0; i < k; i++) {
            if (bit & (1 << i)) {
                tmp += p[i];
            } else {
                tmp -= p[i];
            }
        }
        res.push_back(tmp);
    }
    return res;
}

int main() {
    int N;
    cin >> N;
    vector<vector<ll>> param(N, vector<ll>(5));
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < 5; j++) {
            cin >> param[i][j];
        }
    }
    ll inf = 1LL << 60;
    vector<ll> m(32, inf), M(32, -inf);
    vector<vector<ll>> chs(N);
    for (int i = 0; i < N; i++) {
        auto ch = c(param[i]);
        chs[i] = ch;
        for (int j = 0; j < 32; j++) {
            m[j] = min(m[j], ch[j]);
            M[j] = max(M[j], ch[j]);
        }
    }
    vector<ll> ans(N);
    for (int k = 0; k < N; k++) {
        for (int j = 0; j < 32; j++) {
            ans[k] =
                max({ans[k], abs(chs[k][j] - m[j]), abs(chs[k][j] - M[j])});
        }
    }
    for (int i = 0; i < N; i++) {
        cout << ans[i] << endl;
    }
    return 0;
}