wgreh



package migong_zuiduanlujin;

import java.util.Scanner;

public class Migo_zui {
  //public static int[][] maze={{0,0,1,1,0,0,1,1},{0,0,0,0,1,1,1,1},{0,1,0,1,0,1,1,1},{0,0,0,0,0,0,0,0},{1,0,0,1,0,1,1,1},{0,0,1,0,0,1,1,0},{0,1,0,0,0,0,0,0,},{0,0,0,0,0,0,1,0}};
     public static int[][] maze;
     public static int minX[]=new int[100000];
     public static int minY[]=new int[100000];
     public static int xycount=0;
     public static int pc=2;
     public static int findPath=2;
  public static int dX[]={-1,0,1,0};//shang  you xia left
  public static int dY[]={0,1,0,-1};
     public static boolean isFind=false;
     public static int allmethods=0;
     public static boolean isOut(int curx,int cury){
      boolean result=true;
      if(curx<0||curx>7||cury<0||cury>7)
       result=false;
      return result;
     }
  public static void dFS(int x,int y){
   if(x==7&&y==7){
    isFind=true;
    while(findPath<pc){
    for(int i=0;i<5;i++){
     for(int j=0;j<5;j++){
      if(maze[i][j]==findPath){
       perX[allmethods][xycount]=i;
       perY[allmethods][xycount]=j;
       xycount++;
      }
     }
     
    }
    findPath++;
    }
    allmethods++;
    return ;
   }
   for(int i=0;i<4;i++){
    int newX=x+dX[i];
    int newY=y+dY[i];
    if(isOut(newX,newY)&&maze[newX][newY]==0){
     maze[newX][newY]=pc;
     pc++;
     dFS(newX,newY);
     maze[newX][newY]=0;
    }
   }
  }
  public static void main(String[] args){
   Scanner in=new Scanner(System.in);
   maze=new int[5][5];
      for(int i=0;i<5;i++){
       for(int j=0;j<5;j++){
        maze[i][j]=in.nextInt();
       }
      }
   dFS(0,0);
   System.out.println(" ");
   System.out.println(allmethods);
   if(isFind)
   {
    System.out.print("Success");
   }else{
    System.out.print("fail");
   }
    
  }

 

}