#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define all(s) (s).begin(),(s).end()
#define vcin(n) for(ll i=0;i<ll(n.size());i++) cin>>n[i]
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define se second
//const ll mod = 998244353;
const ll mod = 1000000007;
const ll inf = 2000000000000000000ll;
static const long double pi = 3.141592653589793;
template<class T,class U> void chmax(T& t,const U& u){if(t<u) t=u;}
template<class T,class U> void chmin(T& t,const U& u){if(t>u) t=u;}
ll modPow(ll a, ll n, ll mod) { ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }

int main() {
  /* mod は 1e9+7 */
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(10);
  ll a;
  cin>>a;
  vector<ll> n(a);
  vcin(n);
  vector<vector<ll>> m(a,vector<ll>(a));
  for(int i=0;i<a;i++){
    for(int j=0;j<a;j++){
      cin>>m[i][j];
    }
  }
  ll ans=-inf;
  vector<ll> ans1;
  for(int i=0;i<(1<<a);i++){
    ll tmp=0;
    ll b=i;
    for(int j=0;j<a;j++){
      if(b%2==1){
        tmp+=n[j];
      }
      b/=2;
    }
    bitset<20> s(i);
    for(int x=0;x<a;x++){
      for(int y=x+1;y<a;y++){
        if(s.test(x)&&s.test(y)){
          tmp+=m[x][y];
        }
      }
    }
    if(ans<tmp){
      ans=tmp;
      ll e=i;
      vector<ll> ans2;
      ans1=ans2;
      for(int x=0;x<a;x++){
        if(e%2==1){
          ans1.push_back(x+1);
        }
        e/=2;
      }
    }
  }
  cout<<ans<<endl;
  for(int i=0;i<int(ans1.size());i++){
    cout<<ans1[i];
    if(i!=int(ans1.size())-1){
      cout<<" ";
    }
  }
  cout<<endl;
}