#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=998244353;
constexpr ll INF=1e18;

ll power(ll x, ll y, ll m){
    x%=m;
    ll ret=1;
    while(y){
        if(y&1) ret=ret*x%m;
        x=x*x%m;
        y>>=1;
    }
    return ret;
}

int main(){
    int n; cin >> n;
    VI a(n); REP(i,n) cin >> a[i];
    VVI b(n,VI(n)); REP(i,n)REP(j,n) cin >> b[i][j];
    int ans; ll mx=-INF;
    for(int i=1;i<(1<<n);i++){
        int p=i, q;
        ll sum=0;
        REP(j,n){
            if(p&1){
                sum+=a[j];
                q=i;
                REP(k,j){
                    if(q&1)
                        sum+=b[j][k];
                    q>>=1;
                }
            }
            p>>=1;
        }
        if(mx<sum){
            mx=sum;
            ans=i;
        }
    }
    cout << mx << endl;
    REP(i,n){
        if(ans&1)
            cout << i+1 << " ";
        ans>>=1;
    }
    cout << endl;
    return 0;
}