#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;

int main() {
	lint N;
	cin >> N;
	vvi v(N, vi(5));
	rep(i, N) vin(v[i]);

	lint a=0, b=0, c=0, x, y, z;
	vi ans(N);
	rep(bits, 1<<5) {
		vi t(N);
		a = -LINF;
		b = LINF;
		rep(i, N) {
			rep(j, 5) {
				if ((bits & (1<<j)) != 0) {
					t[i] += v[i][j];
				} else {
					t[i] -= v[i][j];
				}
			}
			chmax(a, t[i]);
			chmin(b, t[i]);
		}
		rep(i, N) {
			chmax(ans[i], t[i]-b);
		}
	}
	rep(i, N) cout << ans[i] << endl;
}