#include<iostream>
#include<cstdio>
#include<stack>
#include<cstring>
#include<string>
using namespace std;
int edges[25][25];
int maxx = 0, maxi = 0;
int list[25];
int visited[25];
int path[25];
stack<int>output;
void DFS(int s, int n, int temp)
{
    visited[s] = 1;
    if (temp > maxx) { maxx = temp; maxi = s; }
    for (int i = 1; i <= n; i++)
    {
        if (!visited[i] && edges[s][i] == 1)
        {
            DFS(i, n, temp + list[i]);
            path[i] = s;
        }
    }
}
int main()
{
    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++)
        scanf("%d", &list[i]);
    for (int i = n - 1; i >= 1; i--)
    {
        for (int j = n - i + 1; j <= n; j++)
        {
            scanf("%d", &edges[n - i][j]);
        }
    }
    int aa = 0;
    int tt = 0;
    for (int i = 1; i <= n; i++)
    {
        
        memset(visited, 0, sizeof(visited));
        DFS(i, n, list[i]);
        if (maxx > tt) { tt=maxx; aa = i; }
    }
    memset(visited, 0, sizeof(visited));
    DFS(aa, n, list[aa]);
    output.push(maxi);
    int temp = path[maxi];
    while (temp != 0)
    {
        output.push(temp);
        temp = path[temp];
    }
    int space = 0;
    while (!output.empty())
    {
        int t = output.top(); output.pop();
        if (space == 0) { printf("%d", t); space++; }
        else printf(" %d", t);
    }
    printf("\n%d", tt);

}