#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

template <class T, class U>
vector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }

template<class... Ts, class U>
auto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }

template<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }
template<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }

int main() {
    int n;
    cin >> n;
    vector<int> a(n);
    vector<vector<int>> b(n, vector<int>(n, 0));
    for (auto &&i : a) scanf("%d", &i);
    for (auto &&i : b) for(auto &&j : i) scanf("%d", &j);
    vector<ll> dp(1 << n, -INF<ll>);
    dp[0] = 0;
    for (int i = 0; i < (1 << n); ++i) {
        for (int j = 0; j < n; ++j) {
            if(!(i & (1 << j))){
                ll val = dp[i] + a[j];
                for (int k = 0; k < n; ++k) {
                    if((i & (1 << k))) val += b[j][k];
                }
                chmax(dp[i^(1 << j)], val);
            }
        }
    }
    dp[0] = -1;
    int x = max_element(dp.begin(),dp.end()) - dp.begin();
    cout << dp[x] << "\n";
    vector<int> ans;
    for (int i = 0; i < n; ++i) {
        if(x & (1 << i)) ans.emplace_back(i+1);
    }
    for (int i = 0; i < ans.size(); ++i) {
        if(i) printf(" ");
        printf("%d",ans[i]);
    }
    puts("");
    return 0;
}