#include<bits/stdc++.h>
using namespace std;
int n,a[105][205],x,y;
int b[105][205],f[105][205];
int dl[20005][2],tzz,wzz;
void to(int nx,int ny,int t)
{
	if(nx<1||nx>n||ny<1||ny>=2*nx)return;
	if(b[nx][ny]==0||f[nx][ny]!=-1)return;
	f[nx][ny]=t,++wzz,dl[wzz][0]=nx,dl[wzz][1]=ny;
}
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)for(int j=1;j<2*i;j++)cin>>a[i][j];
	cin>>x>>y;
	for(int i=1;i<=n;i+=2)for(int j=1;j<2*i;j++)if((a[i][j]+j)%4==1)b[i][j]=1;
	for(int i=2;i<=n;i+=2)for(int j=1;j<2*i;j++)if((a[i][j]-j)%4==0)b[i][j]=1;
	for(int i=1;i<=n;i++)for(int j=1;j<2*i;j++)f[i][j]=-1;
	f[1][1]=0,++wzz,dl[wzz][0]=1,dl[wzz][1]=1;
	while(tzz<wzz)
	{
		++tzz;
		int dx=dl[tzz][0],dy=dl[tzz][1];
		to(dx,dy-1,f[dx][dy]+1),to(dx,dy+1,f[dx][dy]+1);
		if(dy%2==0)to(dx-1,dy-1,f[dx][dy]+1);
		else to(dx+1,dy+1,f[dx][dy]+1);
	}
	cout<<f[x][y];
}