#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define chmin(x,y) x = min((x),(y));
#define chmax(x,y) x = max((x),(y));
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
const int INF = 1e9;
const long long LINF = 1e17;
const int MOD = 1000000007;
//const int MOD = 998244353;
const double PI = 3.14159265358979323846;

int main(){
    int n;
    cin >> n;
    vector<ll> a(n);
    vector<vector<ll>> b(n,vector<ll>(n,0));
    rep(i,n) cin >> a[i];
    rep(i,n)rep(j,n) cin >> b[i][j];
    ll ans = -LINF;
    ll g = 0;
    for(int bit=0;bit<(1<<n);bit++){
        ll res = 0;
        rep(i,n){
            if(bit>>i&1){
                res += a[i];
                rep(j,i){
                    if(bit>>j&1) res += b[i][j];
                }
            }
        }
        if(res > ans){
            ans = res;
            g = bit;
        }
    }
    cout << ans << endl;
    rep(i,n){
        if(g>>i&1) cout << i+1 << " ";
    }
    cout << endl;
    return 0;
}