import sys
def resolve():
    inp = int2d()
    n = inp[0][0]
    scores = inp[1]
    graph = inp[2:]
    dp = [0 for _ in range(1<<n)]
    result = (-1,None)#maxscore, bit

    for bit in range(1<<n):
        for vertex in range(n):
            if not(bit & 1<<vertex): continue
            prebit = bit ^ 1<<vertex

            score = dp[prebit] + scores[vertex]
            for shift in range(n):
                if prebit & 1<<shift:
                    score += graph[shift][vertex]

            dp[bit] = score
            if result[0] < score:
                result = (score, bit)

    l = []
    for i in range(n):
        if result[1] & 1<<i:
            l.append(i+1)

    print(result[0])
    print(*l)
    
def str1d():return sys.stdin.read().splitlines()
def int2d():return [list(map(int,s.split())) for s in str1d()]
resolve()