// #pragma GCC target("avx") // #pragma GCC optimize("O3") // #pragma GCC optimize("unroll-loops") #include using namespace std; #define rep(i,n) for(int i = 0; i < (int)n; i++) #define FOR(n) for(int i = 0; i < (int)n; i++) #define repi(i,a,b) for(int i = (int)a; i < (int)b; i++) #define all(x) x.begin(),x.end() //#define mp make_pair #define vi vector #define vvi vector #define vvvi vector #define vvvvi vector #define pii pair #define vpii vector> template void chmax(T &a, const T &b) {a = (a > b? a : b);} template void chmin(T &a, const T &b) {a = (a < b? a : b);} using ll = long long; using ld = long double; using ull = unsigned long long; const ll INF = numeric_limits::max() / 2; const ld pi = 3.1415926535897932384626433832795028; const ll mod = 998244353; int dx[] = {1, 0, -1, 0, -1, -1, 1, 1}; int dy[] = {0, 1, 0, -1, -1, 1, -1, 1}; #define int long long void solve() { int n; cin >> n; vvi a(n, vi(5)); rep(i, n) rep(j, 5) cin >> a[i][j]; vvi cheby(n, vi(1<<4)); rep(i, n) { rep(j, 1<<4) { int now = a[i][0]; rep(k, 4) { if(j>>k&1) now += a[i][k+1]; else now -= a[i][k+1]; } cheby[i][j] = now; } } vvi pmn(n+1, vi(1<<4, INF)); vvi pmx(n+1, vi(1<<4, -INF)); vvi smn(n+1, vi(1<<4, INF)); vvi smx(n+1, vi(1<<4, -INF)); rep(i, n) rep(j, 1<<4) { pmn[i+1][j] = min(pmn[i][j], cheby[i][j]); pmx[i+1][j] = max(pmx[i][j], cheby[i][j]); } for(int i = n-1; i >= 0; i--) rep(j, 1<<4) { smn[i][j] = min(smn[i+1][j], cheby[i][j]); smx[i][j] = max(smx[i+1][j], cheby[i][j]); } rep(i, n) { int now = 0; rep(j, 1<<4) { chmax(now, cheby[i][j] - pmn[i][j]); chmax(now, pmx[i][j] - cheby[i][j]); chmax(now, cheby[i][j] - smn[i+1][j]); chmax(now, smx[i+1][j] - cheby[i][j]); } cout << now << endl; } } signed main() { cin.tie(nullptr); ios::sync_with_stdio(false); solve(); return 0; }