#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<set>
#include<string>

#define f first
#define s second
#define mp make_pair

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)
#define ALL(c) (c).begin(), (c).end()

using namespace std;

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;

struct pzl{
  ull l;
  pzl() : l(0) {}
  pzl(ull a) : l(a) {}
  inline int get(int i) const{
    return (int)((l >> (4*i)) & 0xF);
  }
  inline ull mask(int i) const{
    return l & ((ull)(0xF) << (4*i));
  }
  inline void set(int i, int n){
    l ^= mask(i);
    l |= ((long long)n << (4*i));
  }
  inline void swap(int i, int j){
    int a = get(i), b = get(j);
    set(i,b); set(j,a);
  }
  inline bool operator < (const pzl &a) const{
    return l < a.l;
  }
  inline bool operator == (const pzl &a) const{
    return l == a.l;
  }
  void print(){
    REP(i,13) printf("%2d ",get(i));
    puts("");
  }
};

int main(){
  pzl ans;
  REP(i,12) ans.set(i,i);
  while(true){
    pzl init;
    int a;
    scanf("%d",&a);
    if(a == -1) break;
    init.set(0,a);
    REP(i,12){ scanf("%d",&a); init.set(i+1,a); }
    
    //init.print();
    queue<pair<int,pzl> > q; q.push(mp(0,init));
    set<ull> s;   s.insert(init.l);
    while(q.size()){
      int cnt = q.front().f;
      pzl p   = q.front().s;
      //printf("cnt: %d\n",cnt);
      //p.print();
      if(p == ans){
	printf("%d\n",cnt);
	break;
      }

      q.pop();

      if(cnt >= 20) continue;
      REP(i,13){
	int g = p.get(i);
	if(g == 0){
	  pzl tmp = p;
#define SP(s,q,tmp) do{if(s.find(tmp.l) == s.end()){ s.insert(tmp.l); q.push(mp(cnt+1,tmp)); }}while(false)
	  switch(i){
	  case 0:  tmp.swap(0,2); SP(s,q,tmp); break;
	  case 1:  tmp.swap(1,2); SP(s,q,tmp); tmp = p; tmp.swap(1,5); SP(s,q,tmp); break;
	  case 2:  tmp.swap(2,0); SP(s,q,tmp); tmp = p; tmp.swap(2,1); SP(s,q,tmp); tmp = p; tmp.swap(2,3); SP(s,q,tmp); tmp = p; tmp.swap(2,6); SP(s,q,tmp); break;
	  case 3:  tmp.swap(3,2); SP(s,q,tmp); tmp = p; tmp.swap(3,7); SP(s,q,tmp); break;
	  case 4:  tmp.swap(4,5); SP(s,q,tmp); break;
	  case 5:  tmp.swap(5,1); SP(s,q,tmp); tmp = p; tmp.swap(5,4); SP(s,q,tmp); tmp = p; tmp.swap(5,6); SP(s,q,tmp); tmp = p; tmp.swap(5,9); SP(s,q,tmp); break;
	  case 6:  tmp.swap(6,2); SP(s,q,tmp); tmp = p; tmp.swap(6,5); SP(s,q,tmp); tmp = p; tmp.swap(6,7); SP(s,q,tmp); tmp = p; tmp.swap(6,10);SP(s,q,tmp); break;
	  case 7:  tmp.swap(7,3); SP(s,q,tmp); tmp = p; tmp.swap(7,6); SP(s,q,tmp); tmp = p; tmp.swap(7,8); SP(s,q,tmp); tmp = p; tmp.swap(7,11);SP(s,q,tmp); break;
	  case 8:  tmp.swap(8,7); SP(s,q,tmp); break; 
	  case 9:  tmp.swap(9,5); SP(s,q,tmp); tmp = p; tmp.swap(9,10);SP(s,q,tmp); break;
	  case 10: tmp.swap(10,6);SP(s,q,tmp); tmp = p; tmp.swap(10,9);SP(s,q,tmp); tmp = p;tmp.swap(10,11);SP(s,q,tmp); tmp = p;tmp.swap(10,12);SP(s,q,tmp); break;
	  case 11: tmp.swap(11,7);SP(s,q,tmp); tmp = p;tmp.swap(11,10);SP(s,q,tmp); break;
	  case 12: tmp.swap(12,10);SP(s,q,tmp);break;
	  }
	}
      }
    }
    if(q.empty())
      printf("NA\n");
  }
  return 0;
}