#include <iostream>

#include <algorithm>

#include <cstdio>

#include <map>

#include <string>

#include <string.h>

#include <queue>

#include <vector>

#include <set>

#include <cmath>

#define inf 0x7fffffff

using namespace std;

char s[],w[][][],flag[][][],m[][][],e[];

int n,sx,sy,sz,gx,gy,gz;

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

struct p{

int x,y,z;

};

int bfs(){

   queue<p> q;

   p a;

   a.x=sx,a.y=sy,a.z=sz;

   flag[sx][sy][sz]=;

   q.push(a);

   while(q.size())

   {

        p b;

        b=q.front();

        q.pop();

        if(b.x==gx&&b.y==gy&&b.z==gz) return ;

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

        {

                int nx=b.x+dir[i][],ny=b.y+dir[i][],nz=b.z+dir[i][];

                if(w[nx][ny][nz]=='O'&&!flag[nx][ny][nz]&&nx>&&nx<=n&&ny>&&ny<=n&&nz>&&nz<=n)

                {

                        flag[nx][ny][nz]=;

                        p c;

                        c.x=nx,c.y=ny,c.z=nz;

                        q.push(c);

                        m[nx][ny][nz]=m[b.x][b.y][b.z]+;

                }

        }

   }

   return ;

}

int main()

{

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

    {

        memset(flag,,sizeof(flag));

        memset(m,,sizeof(m));

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

        {

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

                {

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

                        {

                                scanf(" %c",&w[i][j][h]);

                        }

                }

        }

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

        sx+=,sy+=,sz+=,gx+=,gy+=,gz+=;

        scanf("%s",e);

         if(bfs())

          printf("%d %d\n",n,m[gx][gy][gz]);

          else printf("NO ROUTE\n");

        }

    return ;

}