#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<vector<long long>>a(n, vector<long long>(5));
	rep(i, n)rep(j, 5)cin >> a[i][j];
	vector<long long>ans(n);
	rep(i, 1 << 5) {
		long long mn = LINF;
		long long mx = -LINF;
		vector<long long>v(n);
		rep(j, n) {
			rep(k, 5) {
				if (1 & (i >> k))v[j] += a[j][k];
				else v[j] -= a[j][k];
			}
			chmax(mx, v[j]);
			chmin(mn, v[j]);
		}
		rep(j, n) {
			chmax(ans[j], v[j] - mn);
			chmax(ans[j], mx - v[j]);
		}
	}
	rep(i, n)cout << ans[i] << endl;
	return 0;
}