/* -*- coding: utf-8 -*-
 *
 * 1360.cc:  No.1360 [Zelkova 4th Tune] 協和音 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 18;
const int NBITS = 1 << MAX_N;
const long long LINF = 1LL << 62;

/* typedef */

typedef long long ll;

/* global variables */

int as[MAX_N], bs[MAX_N][MAX_N];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);

  for (int i = 0; i < n; i++) scanf("%d", as + i);
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) scanf("%d", bs[i] + j);

  int nbits = 1 << n, maxbits = 0;
  ll maxsum = -LINF;

  for (int bits = 1; bits < nbits; bits++) {
    ll sum = 0;
    for (int i = 0, bi = 1; i < n; i++, bi <<= 1)
      if (bits & bi) {
	sum += as[i];
	for (int j = i + 1, bj = 1 << j; j < n; j++, bj <<= 1)
	  if (bits & bj) sum += bs[i][j];
      }

    if (maxsum < sum) maxsum = sum, maxbits = bits;
  }

  printf("%lld\n", maxsum);
  for (int i = 0, bi = 1, cont = 0; i < n; i++, bi <<= 1)
    if (maxbits & bi) {
      if (cont) putchar(' ');
      printf("%d", i + 1);
      cont = 1;
    }
  putchar('\n');
  return 0;
}