#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000000000000;
int main(){
  int N;
  cin >> N;
  vector<vector<long long>> X(N, vector<long long>(5));
  for (int i = 0; i < N; i++){
    for (int j = 0; j < 5; j++){
      cin >> X[i][j];
    }
  }
  vector<long long> ans(N, 0);
  for (int i = 0; i < (1 << 5); i++){
    vector<long long> S(N, 0);
    for (int j = 0; j < N; j++){
      for (int k = 0; k < 5; k++){
        if ((i >> k & 1) == 0){
          S[j] += X[j][k];
        } else {
          S[j] -= X[j][k];
        }
      }
    }
    vector<long long> L(N + 1, INF);
    for (int j = 0; j < N; j++){
      L[j + 1] = min(L[j], S[j]);
    }
    vector<long long> R(N + 1, INF);
    for (int j = N - 1; j >= 0; j--){
      R[j] = min(R[j + 1], S[j]);
    }
    for (int j = 0; j < N; j++){
      ans[j] = max(ans[j], S[j] - min(L[j], R[j + 1]));
    }
  }
  for (int i = 0; i < N; i++){
    cout << ans[i] << endl;
  }
}