#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000000000;
int main(){
  int N;
  cin >> N;
  vector<int> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  vector<vector<int>> B(N, vector<int>(N));
  for (int i = 0; i < N; i++){
    for (int j = 0; j < N; j++){
      cin >> B[i][j];
    }
  }
  vector<long long> dp(1 << N, 0);
  for (int i = 0; i < N; i++){
    dp[1 << i] += A[i];
    for (int j = i + 1; j < N; j++){
      dp[(1 << i) + (1 << j)] += B[i][j];
    }
  }
  for (int i = 0; i < N; i++){
    for (int j = 0; j < (1 << N); j++){
      if (j >> i & 1){
        dp[j] += dp[j - (1 << i)];
      }
    }
  }
  long long W = -INF;
  int id = -1;
  for (int i = 1; i < (1 << N); i++){
    if (dp[i] > W){
      W = dp[i];
      id = i;
    }
  }
  cout << W << endl;
  vector<int> j;
  for (int i = 0; i < N; i++){
    if (id >> i & 1){
      j.push_back(i);
    }
  }
  int K = j.size();
  for (int i = 0; i < K; i++){
    cout << j[i] + 1;
    if (i < K - 1){
      cout << ' ';
    }
  }
  cout << endl;
}