#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int main(){
  int N; cin >> N;
  vector<vector<ll>> A(N,vector<ll>(5));
  rep(i,N){
    rep(j,5){
      cin >> A[i][j];
    }
  }
  vector<vector<ll>> C(16,vector<ll>(N));
  rep(i,16){
    rep(j,N){
      ll a = A[j][0];
      rep(k,4){
        a += A[j][k+1] * ((i&(1<<k))?1LL:-1LL);
      }
      C[i][j] = a;
    }
  }
  auto D = C;
  rep(i,16) sort(all(C[i]));
  rep(i,N){
    ll ans = 0;
    rep(j,16){
      ll a = D[j][i];
      chmax(ans,C[j][N-1]-a);
      chmax(ans,a-C[j][0]);
    }
    cout << ans << '\n';
  }
  return 0;
}