#include<bits/stdc++.h>
using namespace std;
constexpr int M=205;
int n,dx,dy,g[M][M],dis[M][M][4][4][4];
queue<tuple<int,int,int,int,int>>q;
int read(){
    int x=0;char ch=getchar();
    while (!isdigit(ch)) ch=getchar();
    while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
    return x;
}
int main(){ n=read();
    for (int i=1;i<=n;i++)
        for (int j=1;j<i<<1;j++)
            g[i][j]=read()-1;
    memset(dis,-1,sizeof(dis));
    dis[1][1][0][1][2]=0;
    q.push({1,1,0,1,2});
    dx=read();dy=read();
    while (!q.empty()){
        auto [x,y,a,b,c]=q.front();q.pop();
        const int d=g[x][y],td=dis[x][y][a][b][c];
        if (dx==x&&dy==y) return printf("%d\n",td),0;
        auto trans=[&](auto x,auto y,auto a,auto b,auto c){
            if (dis[x][y][a][b][c]==-1&&g[x][y]==(a^b^c))
                dis[x][y][a][b][c]=td+1,q.push({x,y,a,b,c});
        };
        if (y&1){
            if (x<n) trans(x+1,y+1,a,c,d);
            if (y>1) trans(x,y-1,b,d,c);
            if (y+1<(x<<1)) trans(x,y+1,d,b,a);
        }
        else{
            if (x>1) trans(x-1,y-1,a,d,b);
            if (y>1) trans(x,y-1,c,b,d);
            if (y+1<(x<<1)) trans(x,y+1,d,a,c);
        }
    }
    puts("-1");
    return 0;
}