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

//#define int long long

typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
typedef vector<vint>vvint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
template<class T,class U>void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>void chmax(T &t,U f){if(t<f)t=f;}

const int dy[]={-1,0,1,0};
const int dx[]={0,-1,0,1};

int p[5][5]={{-1,-1,0,-1,-1},{-1,1,2,3,-1},{4,5,6,7,8},{-1,9,10,11,-1},{-1,-1,0,-1,-1}};
void bfs(vvint &a,map<vvint,int>&s){
    queue<vvint>que[2];
    que[0].push(a);
    s[a]=0;
    rep(i,10){
        while(que[i&1].size()){
            vvint a=que[i&1].front();
            que[i&1].pop();
            rep(y,5)rep(x,5){
                if(a[y][x]!=0)continue;
                rep(d,4){
                    int ny=y+dy[d],nx=x+dx[d];
                    if(ny<0||ny>=5||nx<0||nx>=5||a[ny][nx]<=0)continue;
                    swap(a[ny][nx],a[y][x]);
                    if(s.find(a)==s.end()){
                        s[a]=i+1;
                        que[(i+1)&1].push(a);
                    }
                    swap(a[ny][nx],a[y][x]);
                }
            }
        }
    }
}

signed main(){
    vvint a(5,vint(5,-1));
    while(cin>>a[0][2],a[0][2]!=-1){
        rep(i,3)cin>>a[1][i+1];
        rep(i,5)cin>>a[2][i];
        rep(i,3)cin>>a[3][i+1];
        cin>>a[4][2];

        vvint b(5,vint(5));
        rep(i,5)rep(j,5)b[i][j]=p[i][j];

        map<vvint,int>m1,m2;
        bfs(a,m1);
        bfs(b,m2);

        int ans=21;
        each(it,m1){
            if(m2.find(it->fi)==m2.end())continue;
            chmin(ans,it->se+m2[it->fi]);
        }
        if(ans<=20)cout<<ans<<endl;
        else cout<<"NA"<<endl;
    }
    return 0;
}