#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long a[20], b[20][20];
bool bo[20];
int main() {
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			cin >> b[i][j];
		}
	}
	long ans = -100000000007, ans1;
	for (int i = 1; i < (1 << n); i++) {
		long score = 0;
		for (int j = 0; j < n; j++) {
			if (i & (1 << j)) {
				bo[j] = 1;
				score += a[j];
			}
			else {
				bo[j] = 0;
			}
		}
		for (int j = 0; j < n; j++) {
			for (int k = j + 1; k < n; k++) {
				if (bo[j] && bo[k]) {
					score += b[j][k];
				}
			}
		}
		if (ans < score) {
			ans = score;
			ans1 = i;
		}
	}
	cout << ans << endl;
	int co = 1;
	while (ans1 > 0) {
		if (ans1 % 2 == 1) {
			cout << co << " ";
		}
		ans1 /= 2;
		co++;
	}
	cout << endl;
}