#include<bits/stdc++.h>
using namespace std;

int n,a[210],dp[210],r[210];
int f[210][210];

int main(){
	scanf("%d",&n);
	for(int i = 1;i <= n;i++){
		scanf("%d",&a[i]);
	}
	for(int i = 1;i <= n;i++){
		for(int j = i + 1;j <= n;j++){
			scanf("%d",&f[i][j]);
		}
	}
	dp[n] = a[n];
	int sum = 0,ans = 0;
	for(int i = n - 1;i >= 1;i--){
		ans = 0;
		for(int j = i + 1;j <= n;j++){
			if(f[i][j] == true && dp[j] > ans){
				sum = j;
				ans = dp[j];
			}
		}
		dp[i] = a[i] + ans;
		r[i] = sum;
	}
	sum = 1;
	for(int i = 2;i <= n;i++){
		if(dp[i] > dp[sum]){
			sum = i;
		}
	}
	int ma = dp[sum];
	while(sum != 0){
		printf("%d",sum);
		sum = r[sum];
		if(sum != 0){
			printf(" ");
		}
	}
	printf("\n%d",ma);
	return 0;
}