public class BuXian {
private static int n;
private static int[][] conn;
private static int[] x,bestx;
private static int bestd;
private static int MAX = 100000;
public static void main(String[] args){
Scanner input = new Scanner(System.in);
while (true){
bestd = MAX;
n = input.nextInt();
x = new int[n+1];
bestx = new int[n+1];
conn = new int[n+1][n+1];
for(int i=1; i<=n; i++)
for(int j=i+1; j<=n; j++)
conn[i][j] = input.nextInt();
for(int i=1; i<=n; i++)
x[i] = i;
backtrack(1);
System.out.println(bestd);
for(int i=1; i<=n; i++)
System.out.print(bestx[i]+" ");
}
}
private static void backtrack(int t){
if(t == n){
int tmp = len(t);
if(tmp < bestd){
bestd = tmp;
for(int j=1; j<=n; j++)
bestx[j] = x[j];
}
}
else
for (int j=t; j<=n; j++){
swap(x,t,j);
backtrack(t+1);
swap(x,t,j);
}
}
private static int len(int ii){
int sum = 0;
for(int i=1; i<=ii; i++)
for(int j=i+1; j<=ii; j++){
int dist = x[i]>x[j] ? x[i]-x[j] : x[j]-x[i];
sum += conn[i][j]*dist;
}
return sum;
}
private static void swap(int[] x, int i, int j){
int tmp;
tmp = x[i];
x[i] = x[j];
x[j] = tmp;
}
}