#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------


int N;
int A[18];
int B[18][18];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	FOR(i,N) cin>>A[i];
	FOR(y,N) FOR(x,N) cin>>B[y][x];
	ll ma=-1LL<<60;
	int sm=0;
	int mask;
	FOR(mask,1<<N) if(mask) {
		ll sum=0;
		FOR(i,N) if(mask&(1<<i)) sum+=A[i];
		FOR(y,N) if(mask&(1<<y)) FOR(x,y) if(mask&(1<<x)) sum+=B[y][x];
		if(sum>ma) {
			ma=sum;
			sm=mask;
		}
	}
	cout<<ma<<endl;
	FOR(i,N) if(sm&(1<<i)) cout<<(i+1)<<" ";
	cout<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}