import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
inf = 10**19
# md = 998244353
md = 10**9+7

n = II()
aa = LI()
bb = LLI(n)

btos = [0]*(1 << n)
for i in range(n):
    for j in range(i):
        bit = 1 << i | 1 << j
        cur = bb[i][j]
        s = bit
        while s < (1 << n):
            btos[s] += cur
            s = (s+1) | bit

mx = -inf
ans = 0
for bit in range(1, 1 << n):
    cur = sum(aa[i] for i in range(n) if bit >> i & 1)+btos[bit]
    if cur > mx:
        mx = cur
        ans = bit

print(mx)
print(" ".join(str(i+1) for i in range(n) if ans >> i & 1))