#ifndef hari64
#include <bits/stdc++.h>
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#define debug(...)
#else
#include "util/viewer.hpp"
#define debug(...) viewer::_debug(__LINE__, #__VA_ARGS__, __VA_ARGS__)
#endif
using namespace std;
constexpr int INF = 1001001001;
constexpr long long INFll = 1001001001001001001;
template <class T>
bool chmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0;
}
template <class T>
bool chmin(T& a, const T& b) {
    return a > b ? a = b, 1 : 0;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N;
    cin >> N;
    vector<vector<long long>> Xs(N, vector<long long>(5));
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < 5; j++) {
            cin >> Xs[i][j];
        }
    }

    vector<vector<long long>> rotated(1 << 5, vector<long long>(N));
    for (int i = 0; i < (1 << 5); i++) {
        for (int j = 0; j < N; j++) {
            for (int bit = 0; bit < 5; bit++) {
                rotated[i][j] += Xs[j][bit] * (i & (1 << bit) ? 1 : -1);
            }
        }
    }

    debug(rotated);

    vector<pair<long long, long long>> mima(1 << 5);
    for (int i = 0; i < (1 << 5); i++) {
        mima[i] = make_pair(*min_element(rotated[i].begin(), rotated[i].end()),
                            *max_element(rotated[i].begin(), rotated[i].end()));
    }

    for (int i = 0; i < N; i++) {
        long long ans = 0;
        for (int j = 0; j < (1 << 5); j++) {
            chmax(ans, rotated[j][i] - mima[j].first);
            chmax(ans, mima[j].second - rotated[j][i]);
        }
        cout << ans << endl;
    }

    return 0;
}