#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <limits>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if(a < b){ a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if(a > b){ a = b; return 1; } return 0; }
template<class T> inline int  sz(T &a) { return a.size(); }
using ll = long long; using ld = long double;
using pi = pair<int,int>; using pl = pair<ll,ll>;
using vi = vector<int>; using vvi = vector<vi>;
using vl = vector<ll>; using vvl = vector<vl>;
const int inf = numeric_limits<int>::max();
const ll infll = numeric_limits<ll>::max();
int main()
{
  int n; cin >> n;
  vl a(n);
  rep(i,n) cin >> a[i];
  vvl b(n, vl(n));
  rep(i,n) {
    rep(j,n) {
      cin >> b[i][j];
    }
  }

  int res;
  ll mx = -infll;
  rep1(S,(1<<n)-1) {
    ll sum = 0;
    rep(i,n) {
      if((S>>i)&1) {
        sum += a[i];
      }
    }
    rep(i,n) {
      rep(j,n) {
        if(i >= j) continue;
        if( ((S>>i)&1) && ((S>>j)&1) ) {
          sum += b[i][j];
        }
      }
    }
    if(chmax(mx, sum)) {
      res = S;
    }
  } 
  cout << mx << "\n";
  rep(i,n) {
    if((res>>i)&1) cout << i+1 << " ";
  }
  cout << "\n";
  return 0;
}