import sys
sys.setrecursionlimit(5*10**5)
input = sys.stdin.readline
from collections import defaultdict, deque, Counter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
from math import gcd

n = int(input())
par = []
d = defaultdict(lambda: -float("inf"))
for i in range(n):
    a = list(map(int,input().split()))
    l = []
    for bit in range(32):
        tmp = 0
        for j in range(5):
            if (bit >> j) & 1:
                tmp += a[j]
            else:
                tmp -= a[j]
        l.append(tmp)
        d[bit] = max(d[bit], tmp)
    par.append(l)

for i in range(n):
    ans = -float("inf")
    for j in range(32):
        ans = max(ans, d[31-j] + par[i][j])
    print(ans)