#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N;
	cin >> N;
	vector<int> A(N);
	REP(i, N) scanf("%d", &A[i]);
	vector B(N, vector(N, 0));
	REP(i, N) REP(j, N) scanf("%d", &B[i][j]);
	ll ans = -1, ansbit = -1;
	FOR(i, 1, 1 << N) {
		ll cur = 0;
		REP(j, N) cur += (i >> j & 1) * A[j];
		REP(j, N) FOR(k, j + 1, N) cur += (i >> j & 1 && i >> k & 1) * B[j][k];
		if (chmax(ans, cur)) ansbit = i;
	}
	cout << ans << endl;
	vector<int> ansv;
	REP(i, N) if (ansbit >> i & 1) ansv.emplace_back(i);
	REP(i, ansv.size()) printf("%d%c", ansv[i] + 1, " \n"[i + 1 == ansv.size()]);
}