#include <iostream>
#include <vector>
#include <string>
#include <iomanip>
#include <queue>
#include <cmath>
#include <algorithm>
#include <tuple>
#include <iomanip>
#include <stdio.h>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <queue>
#include <unordered_set>
#include <cassert>
#include <stdlib.h>
#include <time.h>
#include <random>


//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("section-anchors")
//#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
//#pragma GCC optimize("vpt")
//#pragma GCC optimize("rename-registers")
//#pragma GCC optimize("move-loop-invariants")
//#pragma GCC optimize("unswitch-loops")
//#pragma GCC optimize("function-sections")
//#pragma GCC optimize("data-sections")
//#pragma GCC optimize("branch-target-load-optimize")
//#pragma GCC optimize("branch-target-load-optimize2")
//#pragma GCC optimize("btr-bb-exclusive")


#define int long long
#define ll long long
#define ull unsigned long long
#define all(a) a.begin(), a.end()
#define pii pair<int, int>
#define pb push_back
#define ld long double


using namespace std;

const int INF = 1e17;
//const int mod = 2600000069;
//const int p = 179;

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    assert(n < 15);
    vector<vector<int>> g(n, vector<int>(n));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) cin >> g[i][j];
    }
    vector<vector<int>> dp((1 << n), vector<int>(n, INF));
    vector<vector<pii>> p((1 << n), vector<pii>(n, {-1, -1}));
    set<pii> cur = {{1, 0}}, next;
    dp[1][0] = 0;
    for (int i = 1; i < n; i++) {
        for (auto m : cur) {
            for (int to = 0; to < n; to++) {
                if (g[m.second][to] == 0 || ((m.first >> to) & 1)) continue;
                dp[m.first | (1 << to)][to] = min(dp[m.first][m.second] + g[m.second][to], dp[m.first | (1 << to)][to]);
                next.insert({(m.first | (1 << to)), to});
                p[(m.first | (1 << to))][to] = {m.first, m.second};
            }
        }
        cur = next;
        next.clear();
    }
//    for (int i = 0; i < n; i++) {
//        cout << dp[(1 << n) - 1][i] << "\n";
//    }
    int m = INF, curs = -1;
    for (int i = 0; i < n; i++) {
        if (dp[(1 << n) - 1][i] < m) {
            curs = i;
            m = dp[(1 << n) - 1][i];
        }
    }
    int curf = (1 << n) - 1;
    if (m == INF) {
        cout << -1;
        return 0;
    }
    vector<int> path = {};
    pii ss;
    while (curf != -1) {
        path.pb(curs);
        ss = p[curf][curs];
        curf = ss.first;
        curs = ss.second;
    }
    reverse(all(path));
    assert(path.size() == n && path[0] == 0);
    cout << m << "\n";
    for (auto k : path) cout << k + 1 << " ";
}
/*
3
0 3 2
3 0 6
2 6 0

5
0 6 4 0 0
6 0 7 0 7
4 7 0 0 0
0 0 0 0 2
0 7 0 2 0
*/