#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

int main() {
  int N;
  cin >> N;

  ll X[N][5];
  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < 5; ++j) {
      cin >> X[i][j];
    }
  }

  vector<ll> ans(N, LLONG_MIN);

  for (int mask = 0; mask < (1 << 5); ++mask) {
    ll V[N];
    memset(V, 0, sizeof(V));
    ll min_v = LLONG_MAX;

    for (int i = 0; i < N; ++i) {
      for (int j = 0; j < 5; ++j) {
        if (mask >> j & 1) {
          V[i] += X[i][j];
        } else {
          V[i] -= X[i][j];
        }
      }

      min_v = min(min_v, V[i]);
    }

    for (int i = 0; i < N; ++i) {
      ans[i] = max(ans[i], V[i] - min_v);
    }
  }

  for (int i = 0; i < N; ++i) {
    cout << ans[i] << endl;
  }

  return 0;
}