#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() {
    vector<vector<int>> G{{2},{2, 5},{0, 1, 3, 6},{2, 7},{5},{1, 4, 6, 9},{2, 5, 7, 10},{3, 6, 8, 11},{7},{5, 10},{6, 9, 11, 12},{7, 10},{10}};
    vector<int> y{0, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 4}, x{2, 1, 2, 3, 0, 1, 2, 3, 4, 1, 2, 3, 2};
    using P = array<int, 13>;
    P v{};
    iota(v.begin(), v.end(), 0);
    v.back() = 0;
    map<P, int> A;
    auto dfs1 = [&](int a, int b, int cur, auto &&f) -> void {
        if(!A.count(v)) A[v] = cur;
        else chmin(A[v], cur);
        if(cur >= 5) return;
        for (auto &&j : G[a]) {
            if(j != b){
                swap(v[a], v[j]);
                f(j, b, cur+1, f);
                swap(v[a], v[j]);
            }
        }
        for (auto &&j : G[b]) {
            if(j != a){
                swap(v[b], v[j]);
                f(a, j, cur+1, f);
                swap(v[b], v[j]);
            }
        }
        return;
    };
    dfs1(0, 12, 0, dfs1);
    while(cin >> v[0], ~v[0]){
        for (int i = 1; i < 13; ++i) cin >> v[i];
        int ans = 21;
        auto dfs = [&](int cur, auto &&f) -> void {
            if(cur+5 >= ans) return;
            if(A.count(v)) {
                chmin(ans, A[v]+cur);
                return;
            }
            int d = 0, a = -1, b = -1;
            for (int i = 0; i < 13; ++i) {
                if(v[i]) d += abs(y[i]-y[v[i]])+abs(x[i]-x[v[i]]);
                else if(!~a) a = i;
                else b = i;
            }
            if(d+cur >= ans) return;
            for (auto &&j : G[a]) {
                if(j != b){
                    swap(v[a], v[j]);
                    f(cur+1, f);
                    swap(v[a], v[j]);
                }
            }
            for (auto &&j : G[b]) {
                if(j != a){
                    swap(v[b], v[j]);
                    f(cur+1, f);
                    swap(v[b], v[j]);
                }
            }

        };
        dfs(0, dfs);
        if(ans == 21) puts("NA");
        else cout << ans << "\n";
    }
    return 0;
}
