#include <iostream>

 #include <cstring>

 #include <cstdio>

 #include <queue>

 using namespace std;

 char map[][][];

 int v[][][];

 int n;

 int sx,sy,sz;

 int ex,ey,ez;

 int dx[] = {,-,,,,};

 int dy[] = {,,,-,,};

 int dz[] = {,,,,,-};

 int ans ;

 struct node

 {

     int x , y ,z ,step ;

 };

 int bfs()

 {

     node now , t ;

     int fx , fy , fz ;

     queue<node> q ;

     now.x = sx ;

     now.y = sy ;

     now.z = sz ;

     now.step =  ;

     memset(v,,sizeof(v)) ;

     q.push(now) ;

     v[sz][sx][sy] =  ;

     while(!q.empty())

     {

         now = q.front() ;

         q.pop() ;

         if (now.x == ex && now.y == ey && now.z == ez)

         {

             ans  = now.step ;

             return   ;

         }

         for (int i =  ; i <  ; i++)

        {

         fx = now.x + dx[i] ;

         fy = now.y + dy[i] ;

         fz = now.z + dz[i] ;

         if (fx< || fy< || fz< || fx>=n || fy>=n || fz>=n || v[fz][fx][fy] ==  || map[fz][fx][fy] == 'X')

             continue ;

         t.x = fx ;

         t.y = fy ;

         t.z = fz ;

         t.step = now.step +  ;

         v[fz][fx][fy] =  ;

         q.push(t) ;

         }

     }

     return  ;

 }

 int main ()

 {

     //freopen("in.txt","r",stdin) ;

     char s[] ;

     while (scanf("%s %d" , s , &n) !=EOF)

     {

         int i , j , k ;

         for (i =  ; i < n ; i ++)

             for (j =  ; j < n ; j ++)

                   {

                       scanf("%s" , map[i][j]) ;

                   }

         scanf("%d %d %d" , &sx,&sy,&sz) ;

         scanf("%d %d %d" , &ex,&ey,&ez) ;

         scanf("%s" , s) ;

         ans =  ;

         if (bfs())

             printf("%d %d\n" , n , ans) ;

         else

             printf("NO ROUTE\n") ;

     }

     return  ;

 }