n = int(input())
A = [list(map(int, input().split())) for _ in range(n)]

inf = 1 << 60
fi = [-inf] * 32
se = [-inf] * 32
fi_ind = [-1] * 32
se_ind = [-1] * 32

for bit in range(32):
    for i, row in enumerate(A):
        tot = 0
        for j in range(5):
            if bit >> j & 1:
                tot += row[j]
            else:
                tot -= row[j]

        if tot > se[bit]:
            se[bit] = tot
            se_ind[bit] = i
            if se[bit] > fi[bit]:
                fi[bit], se[bit] = se[bit], fi[bit]
                fi_ind[bit], se_ind[bit] = se_ind[bit], fi_ind[bit]

for i, row in enumerate(A):
    ans = 0
    for bit in range(32):
        tot = 0
        for j in range(5):
            if bit >> j & 1:
                tot -= row[j]
            else:
                tot += row[j]

        if i == fi_ind[bit]:
            ans = max(ans, tot + se[bit])
        else:
            ans = max(ans, tot + fi[bit])

    print(ans)