#include <iostream> 
#include <sstream> 
#include <iomanip> 
#include <algorithm> 
#include <cmath> 
#include <string> 
#include <vector> 
#include <list> 
#include <queue> 
#include <stack> 
#include <set> 
#include <map> 
#include <bitset> 
#include <numeric> 
#include <climits> 
#include <cfloat> 
using namespace std;

int main()
{
    string goal = "##.##"
                  "#abc#"
                  "defgh"
                  "#ijk#"
                  "##.##";

    vector<int> pos(256);
    for(int i=0; i<25; ++i){
        if(goal[i] != '#' && goal[i] != '.')
            pos[goal[i]] = i;
    }

    int d[] = {5, -5, 1, -1};

    for(;;){
        string s(25, '#');
        for(int i=0; i<25; ++i){
            if(goal[i] == '#')
                continue;
            int a;
            cin >> a;
            if(a == -1)
                return 0;
            if(a == 0)
                s[i] = '.';
            else
                s[i] = 'a' + a - 1;
        }

        if(s == goal){
            cout << 0 << endl;
            continue;
        }

        set<string> history;
        history.insert(s);
        vector<string> curr(1, s);

        int ret = -1;
        for(int i=0; i<20; ++i){
            vector<string> next;
            for(unsigned j=0; j<curr.size(); ++j){
                int len = 0;
                for(int k=0; k<25; ++k){
                    if(curr[j][k] != '#' && curr[j][k] != '.')
                        len += abs(k/5 - pos[curr[j][k]]/5) + abs(k%5 - pos[curr[j][k]]%5);
                }
                if(len > 20 - i)
                    continue;

                for(int k=0; k<25; ++k){
                    if(curr[j][k] != '.')
                        continue;
                    for(int l=0; l<4; ++l){
                        if(l < 2 && (k+d[l] < 0 || k+d[l] >= 25))
                            continue;
                        if(l >= 2 && (k+5) / 5 != (k+d[l]+5) / 5)
                            continue;
                        if(curr[j][k+d[l]] == '#')
                            continue;
                        swap(curr[j][k], curr[j][k+d[l]]);
                        if(history.find(curr[j]) == history.end()){
                            if(curr[j] == goal)
                                ret = i + 1;
                            history.insert(curr[j]);
                            next.push_back(curr[j]);
                        }
                        swap(curr[j][k], curr[j][k+d[l]]);
                    }
                }
            }
            curr.swap(next);
            if(ret != -1)
                break;
        }

        if(ret == -1)
            cout << "NA" << endl;
        else
            cout << ret << endl;
    }
}