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

#define rep(i, a, n) for(int i=(a); i<(n); ++i)
#define per(i, a, n) for(int i=(a); i>(n); --i)
#define pb emplace_back
#define mp make_pair
#define clr(a, b) memset(a, b, sizeof(a))
#define all(x) (x).begin(),(x).end()
#define lowbit(x) (x & -x)
#define fi first
#define se second
#define lson o<<1
#define rson o<<1|1
#define gmid l[o]+r[o]>>1
 
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll, ll>;
using ui = unsigned int;
 
constexpr int mod = 998244353;
constexpr int inf = 0x3f3f3f3f;
constexpr ll infll = (ll)1e18;
constexpr double EPS = 1e-8;
const double PI = acos(-1.0);

constexpr int N = 2e5 + 10;

ll f[1 << 5];

void _main(){
  int n;
  cin >> n;
  vector<vector<ll>> a(n, vector<ll>(5));
  vector<ll> f(1 << 5, -infll);
  rep(i, 0, n){
    rep(j, 0, 5)  cin >> a[i][j];
    rep(j, 0, 1 << 5){
      ll cur = 0;
      rep(k, 0, 5){
        if(j >> k & 1)  cur += a[i][k];
        else  cur -= a[i][k];
      }
      f[j] = max(f[j], cur);
    }
  }
  int mask = (1 << 5) - 1;
  rep(i, 0, n){
    rep(j, 0, 5)  cin >> a[i][j];
    ll ans = 0;
    rep(j, 0, 1 << 5){
      ll cur = 0;
      rep(k, 0, 5){
        if(j >> k & 1)  cur += a[i][k];
        else  cur -= a[i][k];
      }
      ans = max(ans, cur + f[mask ^ j]);
    }
    cout << ans << '\n';
  }
}

int main(){
  ios::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
  _main();
  return 0;
}