#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  vector<int> a(n); REP(i, n) cin >> a[i];
  vector<vector<int>> b(n, vector<int>(n)); REP(i, n) REP(j, n) cin >> b[i][j];
  ll ans = -LINF;
  int jk = 0;
  FOR(bit, 1, 1 << n) {
    ll score = 0;
    vector<int> sound;
    REP(i, n) {
      if (bit >> i & 1) {
        score += a[i];
        sound.emplace_back(i);
      }
    }
    REP(i, sound.size()) FOR(j, i + 1, sound.size()) score += b[sound[i]][sound[j]];
    if (chmax(ans, score)) jk = bit;
  }
  cout << ans << '\n';
  vector<int> j;
  REP(i, n) {
    if (jk >> i & 1) j.emplace_back(i);
  }
  REP(i, j.size()) cout << j[i] + 1 << " \n"[i + 1 == j.size()];
  return 0;
}