program puzzle;
constmaxn=10007;
typehh=^node;node=recorddata:longint;text:longint;next:hh;end;
vardx:array[1..4]of longint=(0,0,1,-1);dy:array[1..4]of longint=(1,-1,0,0);hash:array[0..1,0..maxn]of hh;head,tail:array[0..1]of longint;w:array[0..1,0..362881,1..3,1..3]of longint;b:array[1..3,1..3]of longint;px,py,v:array[0..1,0..362881]of longint;n,i,m,j,x,y,s,h,t,k,r:longint;c:char;
function haha(t,x:longint):boolean;var i,j,xx:longint;p:hh;beginxx:=x mod maxn;new(p);p:=hash[t,xx];while p<>nil dobeginif p^.data=x then begin r:=p^.text; exit(true); end;p:=p^.next;end;exit(false);end;
procedure put(t,x:longint);
var q:hh;xx:longint;
beginxx:=x mod maxn;new(q);q^.data:=x; q^.text:=tail[t]; q^.next:=hash[t,xx];hash[t,xx]:=q;
end;
procedure bfs(x:longint);
var i,j,u,l,ans,xx,yy,g,tmp:longint;
beginhead[x]:=head[x]+1;for i:=1 to 4 dobegin   b:=w[x,head[x]];xx:=px[x,head[x]]+dx[i]; yy:=py[x,head[x]]+dy[i];tmp:=b[xx,yy]; b[xx,yy]:=b[px[x,head[x]],py[x,head[x]]];b[px[x,head[x]],py[x,head[x]]]:=tmp;g:=100000000; ans:=0;for u:=1 to 3 do beginfor l:=1 to 3 dobegin ans:=ans+g*b[u,l]; g:=g div 10; end;end;if (xx>0)and(xx<=3)and(yy>0)and(yy<=3)and(haha(x,ans)=false) thenbegintail[x]:=tail[x]+1; px[x,tail[x]]:=xx; py[x,tail[x]]:=yy; w[x,tail[x]]:=b; v[x,tail[x]]:=v[x,head[x]]+1; put(x,ans);if haha(1-x,ans)=true thenbeginwriteln(v[x,tail[x]]+v[1-x,r]); k:=1; break;end;//在另一个方向的队列中查找该节点end;if k=1 then break;end;if k=1 then exit;
end;
begint:=100000000;for i:=1 to 3 do beginfor j:=1 to 3 dobegin read(c);if c='0' then begin x:=i; y:=j;end;w[1,1,i,j]:=ord(c)-48; s:=s+w[1,1,i,j]*t; t:=t div 10;  end;end;put(0,123804765); put(1,s); k:=0;//存入两个hash数组w[0,1,1,1]:=1; w[0,1,1,2]:=2; w[0,1,1,3]:=3;w[0,1,2,1]:=8; w[0,1,2,2]:=0; w[0,1,2,3]:=4;w[0,1,3,1]:=7; w[0,1,3,2]:=6; w[0,1,3,3]:=5;v[0,1]:=0; v[1,1]:=0; px[0,1]:=2; py[0,1]:=2; px[1,1]:=x; py[1,1]:=y;head[0]:=0; head[1]:=0; tail[0]:=1; tail[1]:=1;repeatif (tail[0]>head[0])and((tail[0]-head[0]<tail[1]-head[1])or(tail[1]<=head[1]))then bfs(0) else if tail[1]>head[1] then bfs(1);//交替扩展节点if k=1 then break;until ((head[0]>=tail[0])or(tail[0]>=362880))and((head[1]>=tail[1])or(tail[1]>=362880));
end.