#include<iostream>

using namespace std;

int n,head=,tail=,a[][],h[],l[],t[];

int a1[]={,-,,,},a2[]={,,,-,};

int c1[]={,-,-,,},c2[]={,-,,-,};

int flag[][];

char s;

int main(){

    cin>>n;

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

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

       {

           cin>>s;

           a[i][j]=int(s)-int('A')+;

           if(a[i][j]==)

           flag[i][j]=0x3f3f3f3f;

       }

    flag[][]=;

    flag[][n]=;

    flag[n][]=;

    h[]=;

    h[]=;

    h[]=n;

    l[]=;

    l[]=n;

    l[]=;

    while(head!=tail)

    {

        head++;

        int x=h[head],y=l[head];

        if(a[x][y]==)

        {

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

            {

                if(x+a1[i]>&&x+a1[i]<=n&&y+a2[i]>&&y+a2[i]<=n)

                {

                    if(flag[x+a1[i]][y+a2[i]]==||flag[x+a1[i]][y+a2[i]]>flag[x][y]+)

                    tail++;

                    h[tail]=x+a1[i];

                    l[tail]=y+a2[i];

                    flag[x+a1[i]][y+a2[i]]=flag[x][y]+;

                }

            }

        }

        if(a[x][y]==)

        {

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

            {

                if(x+a1[i]*>&&x+a1[i]*<=n&&y+a2[i]*>&&y+a2[i]*<=n)

                {

                    if(flag[x+a1[i]*][y+a2[i]*]==||flag[x+a1[i]*][y+a2[i]*]>flag[x][y]+)

                    tail++;

                    h[tail]=x+a1[i]*;

                    l[tail]=y+a2[i]*;

                    flag[x+a1[i]*][y+a2[i]*]=flag[x][y]+;

                }

            }

        }

        if(a[x][y]==)

        {

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

            {

                if(x+c1[i]>&&x+c1[i]<=n&&y+c2[i]>&&y+c2[i]<=n)

                {

                    if(flag[x+c1[i]][y+c2[i]]==||flag[x+c1[i]][y+c2[i]]>flag[x][y]+)

                    tail++;

                    h[tail]=x+c1[i];

                    l[tail]=y+c2[i];

                    flag[x+c1[i]][y+c2[i]]=flag[x][y]+;

                }

            }

        }

    }

    if(a[n][n]==)

    cout<<"GO to find Marx";

    else

    cout<<a[n][n];

    return ;

}