def bit(S,k):
    return (S>>k)&1

def solve():
    N=int(input())
    F=[None]*N
    for i in range(N):
        F[i]=list(map(int,input().split()))


    K=5
    inf=float("inf")

    T=[[0]*(1<<K) for _ in range(N)]
    U=[inf]*(1<<K)
    for i in range(N):
        Ti=T[i]; Fi=F[i]
        for S in range(1<<K):
            for j in range(K):
                Ti[S]+=(1 if bit(S,j) else -1)*Fi[j]
            U[S]=min(U[S], Ti[S])

    Ans=[0]*N
    for i in range(N):
        Ti=T[i]
        Ans[i]=max(Ti[S]-U[S] for S in range(1<<K))
    return Ans

#==================================================
import sys
input=sys.stdin.readline
write=sys.stdout.write

write("\n".join(map(str,solve())))