#include <bits/stdc++.h>
#define pii pair<int,int>
#define mpr make_pair
using namespace std;
inline int read(){
    int x=0,f=1;char ch=getchar();
    for(;!isdigit(ch);ch=getchar())f^=ch=='-';
    for(;isdigit(ch);ch=getchar())x=x*10+(ch^48);
    return f?x:-x;
}
const int N=205,inf=1e5;
int n,a[N][N],dis[N][N],state[N][N],col[N][N];
queue<pii> que;
int inside(int x,int y){
    int l=n-x+1,r=n+x-1;
    return x<=n&&l<=y&&y<=r&&state[x][y]==a[x][y];
}
int main(){
    n=read();
    for(int i=1;i<=n;++i){
        for(int j=n-(i-1);j<=n+(i-1);++j)
            a[i][j]=read();
        if(i==1)col[i][n]=1;
        else{
            col[i][n]=!col[i-1][n];
            for(int j=1;j<=i-1;++j){
                col[i][n-j]=!col[i][n-j+1];
                col[i][n+j]=!col[i][n+j-1];
            }
        }
    }
    state[1][n]=4;
    state[1][n-1]=1;
    state[1][n+1]=3;
    state[2][n]=2;
    state[2][n-1]=1;
    state[2][n+1]=3;
    for(int i=3;i<=n;++i){
        for(int j=0;j<=i-1;++j){
            // if(j==0&&i==2)continue;
            if(col[i][n-j]){
                if(j!=i-1)state[i][n-j]=state[i-1][n-j];
                else state[i][n-j]=state[i-2][n-j+2];
            }else state[i][n-j]=state[i-1][n-j+2];
            if(col[i][n+j]){
                if(j!=i-1)state[i][n+j]=state[i-1][n+j];
                else state[i][n+j]=state[i-2][n+j-2];
            }else state[i][n+j]=state[i-1][n+j-2];
        }
    }
    // puts("col");
    // for(int i=1;i<=n;++i,puts(""))for(int j=1;j<=n*2;++j){
    //     printf("%d ",col[i][j]);
    // }
    // puts("a");
    // for(int i=1;i<=n;++i,puts(""))for(int j=1;j<=n*2;++j){
    //     printf("%d ",a[i][j]);
    // }
    // puts("state");
    // for(int i=1;i<=n;++i,puts(""))for(int j=1;j<=n*2;++j){
    //     printf("%d ",state[i][j]);
    // }
    memset(dis,0x3f,sizeof(dis));
    dis[1][n]=0;
    que.push(mpr(1,n));
    while(que.size()){
        auto [x,y]=que.front();
        que.pop();
        for(int t=-1;t<=1;t+=2){
            if(inside(x,y+t)&&dis[x][y+t]>dis[x][y]+1){
                dis[x][y+t]=dis[x][y]+1;
                que.push(mpr(x,y+t));
            }
        }
        int d=col[x][y]?1:-1;
        if(inside(x+d,y)&&dis[x+d][y]>dis[x][y]+1){
            dis[x+d][y]=dis[x][y]+1;
            que.push(mpr(x+d,y));
        }
    }
    int dx=read(),dy=read();
    dy+=n-dx;
    if(dis[dx][dy]>inf)puts("-1");
    else printf("%d\n",dis[dx][dy]);
}