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

vector<ll> max_manhattan_distance(const vector<vector<ll>> &p) {
    int k = p[0].size(), N = p.size();
    int maxbit = 1 << (k - 1);
    vector<vector<ll>> fp(N, vector<ll>(maxbit));
    for (int i = 0; i < N; i++) {
        for (int bit = 0; bit < maxbit; bit++) {
            ll tmp = p[i][k - 1];
            for (int j = 0; j < k - 1; j++) {
                if (bit & (1 << j)) {
                    tmp += p[i][j];
                } else {
                    tmp -= p[i][j];
                }
            }
            fp[i][bit] = tmp;
        }
    }
    ll INF = 1LL << 60;
    vector<ll> m(maxbit, INF), M(maxbit, -INF);
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < maxbit; j++) {
            m[j] = min(m[j], fp[i][j]);
            M[j] = max(M[j], fp[i][j]);
        }
    }
    vector<ll> res(N);
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < maxbit; j++) {
            res[i] = max({res[i], abs(fp[i][j] - m[j]), abs(fp[i][j] - M[j])});
        }
    }
    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];
        }
    }
    auto ans = max_manhattan_distance(param);
    for (auto a : ans) {
        cout << a << endl;
    }
    return 0;
}