#include <bits/stdc++.h>
// #define int long long
#define endl '\n'
#define pii pair<int,int>

using namespace std;

const int N = 300;

int n;
int a[N][N],b[N][N],step[N][N];
bool v[N][N];
bool vis[N][N];
int edx,edy;

int u[3][2] = {{0,-1},{0,1},{1,1}};

bool pd(int x,int y){
    return x>=1&&x<=n&&y>=1&&y<=(2*x-1);
}

void bfs(int stx,int sty){
    queue<pii> q;
    q.push({stx,sty});
    while(q.size()){
        int x = q.front().first;
        int y = q.front().second;
        q.pop();
        if(vis[x][y] || !v[x][y]) continue;
        vis[x][y] = 1;
        for(int i = 0;i<3;i++){
            if(y%2==0 && i==2) continue;
            int xx = x + u[i][0];
            int yy = y + u[i][1];
            if(!pd(xx,yy) || !v[xx][yy]) continue;
            step[xx][yy] = min(step[xx][yy],step[x][y] + 1);
            q.push({xx,yy});
        }
    }
}

void solve(){
    cin>>n;
    for(int i = 1;i<=n;i++){
        for(int j = 1;j<=2*i-1;j++){
            cin>>a[i][j];
            step[i][j] = INT_MAX;
        }
    }
    step[1][1] = 0;
    cin>>edx>>edy;
    for(int i = 1;i<=n;i++){
        for(int j = 1;j<=2*i-1;j++){
            if(i&1){
                int x = j-1; x%=4;
                b[i][j] = 4-x;
            } else {
                int x = j-1; x%=4;
                b[i][j] = x+1;
            }
        }
    }
    for(int i = 1;i<=n;i++){
        for(int j = 1;j<=2*i-1;j++){
            if(a[i][j] == b[i][j]) v[i][j] = 1;
        }
    }
    // for(int i = 1;i<=n;i++){
    //     for(int j = 1;j<=2*i-1;j++){
    //         cout<<v[i][j]<<" ";
    //     }
    //     cout<<endl;
    // }
    bfs(1,1);
    if(step[edx][edy] == INT_MAX) cout<<-1<<endl;
    else cout<<step[edx][edy]<<endl;
}

signed main(){
    // int T; cin>>T; while(T--)
    solve();
    return 0;
}