#include<bits/stdc++.h>
#define F(i,l,r) for(int i=(l),i##end=(r);i<=i##end;++i)
#define G(i,l,r) for(int i=(l),i##end=(r);i>=i##end;--i)
#define pii pair<int,int>
#define x first
#define y second
#define mp(x,y) make_pair(x,y)
#define ep emplace_back
using namespace std;
typedef long long ll;
int a[209][209];
vector<int> p[100000];
struct node
{
	bool flag;
	int d,l,r,s;
	int p()
	{
	if(d==1&&s==2&&l==3&&r==4)return 0;
	if(d==1&&s==2&&l==4&&r==3)return 1;
	if(d==1&&s==3&&l==2&&r==4)return 2;
	if(d==1&&s==3&&l==4&&r==2)return 3;
	if(d==1&&s==4&&l==2&&r==3)return 4;
	if(d==1&&s==4&&l==3&&r==2)return 5;
	if(d==2&&s==1&&l==3&&r==4)return 6;
	if(d==2&&s==1&&l==4&&r==3)return 7;
	if(d==2&&s==3&&l==1&&r==4)return 8;
	if(d==2&&s==3&&l==4&&r==1)return 9;
	if(d==2&&s==4&&l==1&&r==3)return 10;
	if(d==2&&s==4&&l==3&&r==1)return 11;
	if(d==3&&s==1&&l==2&&r==4)return 12;
	if(d==3&&s==1&&l==4&&r==2)return 13;
	if(d==3&&s==2&&l==1&&r==4)return 14;
	if(d==3&&s==2&&l==4&&r==1)return 15;
	if(d==3&&s==4&&l==1&&r==2)return 16;
	if(d==3&&s==4&&l==2&&r==1)return 17;
	if(d==4&&s==1&&l==2&&r==3)return 18;
	if(d==4&&s==1&&l==3&&r==2)return 19;
	if(d==4&&s==2&&l==1&&r==3)return 20;
	if(d==4&&s==2&&l==3&&r==1)return 21;
	if(d==4&&s==3&&l==1&&r==2)return 22;
	if(d==4&&s==3&&l==2&&r==1)return 23;
	}
	void down()
	{
		assert(flag==false);
		flag=1;
		swap(d,s);
	}
	void up()
	{
		assert(flag==true);
		flag=0;
		swap(d,s);
	}
	void left()
	{
		if(flag==true)
		{
			flag=0;
			int d1=l,r1=d,l1=s,s1=r;
			s=s1,d=d1,r=r1,l=l1;
		}
		else
		{
			flag=1;
			int d1=l,r1=d,l1=s,s1=r;
			s=s1,d=d1,r=r1,l=l1;
		}
	}
	void right()
	{
		if(flag==true)
		{
			flag=0;
			int d1=r,r1=s,l1=d,s1=l;
			s=s1,d=d1,r=r1,l=l1;
		}
		else
		{
			flag=1;
			int d1=r,r1=s,l1=d,s1=l;
			s=s1,d=d1,r=r1,l=l1;
		}
	}
};
int f(int x,int y)
{
	return x*200+y;
}
int dis[200*200][24];

int main()
{
	cin.tie(0)->sync_with_stdio(false);
	int n;
	cin>>n;
	memset(dis,0x3f,sizeof dis);
	F(i,1,n)F(j,1,2*i-1)cin>>a[i][j];
	int s=f(1,1);
	node p;p.flag=0;p.l=1;p.r=3;p.d=4;p.s=2;
	dis[s][p.p()]=0;
	queue<pair<pair<int,int>,node>> q;q.push(mp(mp(1,1),p));
	while(!q.empty())
	{
		auto fr=q.front();q.pop();
		int x=fr.x.x,y=fr.x.y;node s=fr.y;
		//cerr<<x<<' '<<y<<'\n';
		if(!s.flag)
		{
			node p=s;p.down();
			if(p.d==a[x+1][y+1]&&dis[f(x+1,y+1)][p.p()]>dis[f(x,y)][s.p()]+1) dis[f(x+1,y+1)][p.p()]=dis[f(x,y)][s.p()]+1,q.push(mp(mp(x+1,y+1),p));
			p=s;p.left();
			if(p.d==a[x][y-1]&&dis[f(x,y-1)][p.p()]>dis[f(x,y)][s.p()]+1) dis[f(x,y-1)][p.p()]=dis[f(x,y)][s.p()]+1,q.push(mp(mp(x,y-1),p));
			p=s;p.right();
			if(p.d==a[x][y+1]&&dis[f(x,y+1)][p.p()]>dis[f(x,y)][s.p()]+1) dis[f(x,y+1)][p.p()]=dis[f(x,y)][s.p()]+1,q.push(mp(mp(x,y+1),p));
		}
		else
		{
			node p=s;p.up();
			if(p.d==a[x-1][y-1]&&dis[f(x-1,y-1)][p.p()]>dis[f(x,y)][s.p()]+1) dis[f(x-1,y-1)][p.p()]=dis[f(x,y)][s.p()]+1,q.push(mp(mp(x-1,y-1),p));
			p=s;p.left();
			if(p.d==a[x][y-1]&&dis[f(x,y-1)][p.p()]>dis[f(x,y)][s.p()]+1) dis[f(x,y-1)][p.p()]=dis[f(x,y)][s.p()]+1,q.push(mp(mp(x,y-1),p));
			p=s;p.right();
			if(p.d==a[x][y+1]&&dis[f(x,y+1)][p.p()]>dis[f(x,y)][s.p()]+1) dis[f(x,y+1)][p.p()]=dis[f(x,y)][s.p()]+1,q.push(mp(mp(x,y+1),p));
		}
	}
	int X,Y;
	cin>>X>>Y;
	int ans=1000000;
	F(i,0,23) ans=min(ans,dis[f(X,Y)][i]);
	if(ans==1000000)cout<<-1<<'\n';
	else cout<<ans<<'\n';
	return 0;
}