#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}


signed main(){
    int n;cin>>n;
    vector<ll> a(n);
    cin>>a;
    vector<vector<ll>> b(n,vector<ll>(n));
    cin>>b;

    int w;
    ll ans=-LINF;
    for(int bit=1;bit<(1<<n);bit++){
        ll s=0;
        rep(i,n){
            if((bit>>i)&1) s+=a[i];
            rep(j,i){
                if((bit>>i)&1)if((bit>>j)&1) s+=b[i][j];
            }
        }
        if(chmax(ans,s)) w=bit;
    }

    cout<<ans<<endl;
    vector<int> res;
    rep(i,n)if((w>>i)&1) res.push_back(i+1);
    cout<<res<<endl;
    return 0;
}