#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=200+5,M=(1<<28)+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,A[N][N],B[N][N],vis[N][N];
int up[5]={0,3,4,1,2};
int lef[5]={0,2,1,4,3};
int righ[5]={0,4,3,2,1};
int dis[N][N];
void Solve(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=2*i-1;j++) scanf("%d",&A[i][j]);
	}
	B[1][1]=4;
	for(int i=2;i<=n;i++){
		for(int j=1;j<=2*(i-1)-1;j+=2) B[i][j+1]=up[B[i-1][j]];
		for(int j=2;j<=2*i-1;j+=2) B[i][j-1]=lef[B[i][j]],B[i][j+1]=righ[B[i][j]];
	}
	for(int i=1;i<=n;i++) for(int j=1;j<=2*i-1;j++) vis[i][j]=(A[i][j]==B[i][j]),gdb(i,j,B[i][j]);
	dis[1][1]=1;
	queue<pii> q;q.emplace(1,1);
	while(!q.empty()){
		auto [x,y]=q.front();q.pop();
		for(auto [a,b]:{y&1?make_pair(x+1,y+1):make_pair(x-1,y-1),make_pair(x,y-1),make_pair(x,y+1)})if(a<=n&&b>=1&&b<=a*2-1&&vis[a][b]&&!dis[a][b]){
			dis[a][b]=dis[x][y]+1;q.emplace(a,b);
		}
	}
	int tx,ty;scanf("%d%d",&tx,&ty);
	if(!dis[tx][ty]) puts("-1");
	else printf("%d\n",dis[tx][ty]-1);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}