// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2")
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define ull unsigned long long
//#define int long long
#define SZ(x) ((int)((x).size()))
#define ALL(x) (x).begin(),(x).end()
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	return f?-x:x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 500005
#define inf 0x3f3f3f3f

int n,tx,ty;
int a[505][505];
queue<  array<int,5> >q;
bool vis[505][505];
int mp[505][505],dis[505][505];
int d1[4]={4,2,3,1},d2[4]={4,2,1,3},d3[4]={3,1,2,4};
void work()
{
	n=read();
	For(i,1,n){
		For(j,1,i*2-1)a[i][j]=read();
	}
	mp[1][1]=d1[0];
	int o=0;
	int x=1,y=1;
	while(1){
		if(x==n && y==n*2-1) break;
		if(y%2==0)++y;
		else ++x,++y;
		o=(o+1)%4;
	//	cout<<"x,y "<<x<<" "<<y<<" "<<d1[o]<<endl; 
		mp[x][y]=d1[o];
	}
	
	
	For(i,1,n) if(i%2==1) {
		o=0;
		int x=i,y=i*2-1;
		For(j,0,3)if(d2[j]==mp[x][y])o=j;
		while(1){
			o=(o+1)%4;
			if(y%2==0)--y;
			else ++x,++y;
			if(x<=n && y>0)	mp[x][y]=d2[o];
			else break;
		}
	}
	For(i,1,n) if(i%2==0) {
		o=0;
		int x=i,y=i*2-1;
		For(j,0,3)if(d3[j]==mp[x][y])o=j;
		while(1){
			o=(o+1)%4;
			if(y%2==0)--y;
			else ++x,++y;
			if(x<=n && y>0)	mp[x][y]=d3[o];
			else break;
		}
	}
	
	
//	For(i,1,n){
//		For(j,1,i*2-1)cout<<mp[i][j]<<" ";
//		cout<<endl;
//	}
	tx=read(),ty=read();
	queue<pii>q;
	q.push(mkp(1,1)),vis[1][1]=1;
	while(q.size()){
		auto [x,y]=q.front();q.pop();
		vector<pii>tmp;
		tmp.pb(mkp(x,y-1)),tmp.pb(mkp(x,y+1));
		if(y%2==0) tmp.pb(mkp(x-1,y-1));
		else tmp.pb(mkp(x+1,y+1));
		for(auto [xx,yy]:tmp){
			if(xx>=1 && yy>=1 && xx<=n && yy<=xx*2-1){
				if(mp[xx][yy]==a[xx][yy] && !vis[xx][yy]){
					vis[xx][yy]=1;
					dis[xx][yy]=dis[x][y]+1;
					q.push(mkp(xx,yy));
				}
			}
		}
	}
	if(!vis[tx][ty])puts("-1");
	else cout<<dis[tx][ty]<<endl;
}

signed main()
{
    int T=1;
    while(T--)work();
    return 0;
}
/*
123 123
5 1
1 2
1 3
1 4
1 5
1
*/