//#define LOCAL

 #include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <queue>

 #include <algorithm>

 using namespace std;

 struct Point

 {

     char type;

     int x, y, z;

     int steps;

 }start, end;

 char map[][][];

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

 char buff[];

 int n;

 bool islegal(int x, int y, int z)

 {

     return (x>= && x<n && y>= && y<n && z>= && z<n && map[z][x][y]!='X');

 }

 void BFS(void)

 {

     queue<Point> qu;

     start.steps = ;

     qu.push(start);

     while(!qu.empty())

     {

         Point now = qu.front();

         if(now.x==end.x && now.y==end.y && now.z==end.z)

         {

             printf("%d %d\n", n, now.steps);

             return;

         }

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

         {

             int xx = now.x + dir[i][];

             int yy = now.y + dir[i][];

             int zz = now.z + dir[i][];

             if(islegal(xx, yy, zz))

             {

                 Point next;

                 next.x = xx, next.y = yy, next.z = zz, next.steps = now.steps + ;

                 map[zz][xx][yy] = 'X';

                 qu.push(next);

             }

         }

         qu.pop();

     }

     printf("NO ROUTE\n");

 }

 int main(void)

 {

     #ifdef LOCAL

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

     #endif

     while(cin >> buff >> n)

     {

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

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

                 cin >> map[i][j];

         cin >> start.x >> start.y >> start.z;

         cin >> end.x >> end.y >> end.z;

         cin >> buff;

         BFS();

     }

     return ;

 }