N = int(input())
A = list(map(int, input().split()))
B = [list(map(int, input().split())) for _ in range(N)]
INF = 10**20
dp = [[-INF for _ in range(1<<N)] for _ in range(N+1)]
dp[0][0] = 0
for i in range(N):
    for j in range(1<<N):
        if dp[i][j]==-INF:
            continue
        dp[i+1][j] = max(dp[i+1][j], dp[i][j])
        sco = dp[i][j]+A[i]
        for k in range(N):
            if (j>>k)&1==1:
                sco+=B[i][k]
        dp[i+1][j|(1<<i)] = max(dp[i+1][j|(1<<i)], sco)
w = -INF
wj = -1
for j in range(1, 1<<N):
    if w<dp[N][j]:
        w = dp[N][j]
        wj = j
ans = []
for k in range(N):
    if (wj>>k)&1==1:
        ans.append(k+1)
print(w)
print(*ans)