#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
using ll=long long;
using Graph=vector<vector<int>>;
#define MOD 998244353
#define INF 1000000000000000000
#define MAX 2000

int main(){
  int N;
  cin>>N;
  vector<ll> A(N);
  vector<vector<ll>> B(N,vector<ll>(N));
  for(int i=0;i<N;i++){
    cin>>A[i];
  }
  for(int i=0;i<N;i++){
    for(int j=0;j<N;j++){
      cin>>B[i][j];
    }
  }
  vector<ll> dp(1<<N,-INF);
  dp[0]=0;
  for(int i=1;i<(1<<N);i++){
    int bit=i;
    int k=0;
    while(bit!=1){
      bit>>=1;
      k++;
    }
    bit=i-(1<<k);
    dp[i]=dp[bit]+A[k];
    for(int j=0;j<k;j++){
      if((bit&1)==1){
        dp[i]+=B[j][k];
      }
      bit>>=1;
    }
  }

  ll score=0;
  int bit=0;
  for(int i=0;i<(1<<N);i++){
    if(dp[i]>=score){
      bit=i;
      score=dp[i];
    }
  }
  vector<int> ans;
  for(int i=0;i<N;i++){
    if(((bit>>i)&1)==1){
      ans.push_back(i+1);
    }
  }
  cout<<score<<endl;
  for(int i=0;i<ans.size();i++){
    cout<<ans[i]<<" ";
  }
  cout<<endl;
}