#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
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 (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int main(){
  int N; cin >> N;
  vector<ll> A(N); rep(i,N) cin >> A[i];
  vector<vector<ll>> B(N,vector<ll>(N,0));
  rep(i,N) rep(j,N) cin >> B[i][j];
  ll ans = -(1LL<<60);
  vector<int> out;
  rep(i,1<<N){
    if(i==0) continue;
    ll tmp = 0;
    rep(j,N){
      if(i&(1<<j)){
        tmp+=A[j];
        rep(k,j){
          if(i&(1<<k)){
            tmp+=B[j][k];
          }
        }
      }
    }
    if(chmax(ans,tmp)){
      out.clear();
      rep(j,N){
        if(i&(1<<j)) out.pb(j+1);
      }
    }
  }
  cout << ans << endl;
  rep(i,sz(out)){
    if(i) cout << ' ';
    cout << out[i];
  }
  cout << endl;
  return 0;
}