//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int grid[105][205];
int dist[105][205][4][4][4][4];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
		for(int j=1;j<i+i;j++)
		{
			cin>>grid[i][j];
			grid[i][j]--;
		}
	int xx,yy;
	cin>>xx>>yy;
	memset(dist,-1,sizeof(dist));
	dist[1][1][3][0][1][2]=0;
	queue<int> q;
	q.push(1);
	q.push(1);
	q.push(3);
	q.push(0);
	q.push(1);
	q.push(2);
	auto ext=[&]()
	{
		int x=q.front();
		q.pop();
		return x;
	};
	while(!q.empty())
	{
		int x=ext();
		int y=ext();
		int a=ext();
		int b=ext();
		int c=ext();
		int d=ext();
		int D=dist[x][y][a][b][c][d];
		if(x==xx&&y==yy)
		{
			cout<<D<<'\n';
			return 0;
		}
		if(y&1)
		{
			if(x+1<=n)
			{
				if(dist[x+1][y+1][c][b][a][d]==-1&&grid[x+1][y+1]==c)
				{
					dist[x+1][y+1][c][b][a][d]=D+1;
					q.push(x+1);
					q.push(y+1);
					q.push(c);
					q.push(b);
					q.push(a);
					q.push(d);
				}
			}
			if(y>1)
			{
				if(dist[x][y-1][b][c][d][a]==-1&&grid[x][y-1]==b)
				{
					dist[x][y-1][b][c][d][a]=D+1;
					q.push(x);
					q.push(y-1);
					q.push(b);
					q.push(c);
					q.push(d);
					q.push(a);
				}
			}
			if(y<x+x-1)
			{
				if(dist[x][y+1][d][a][b][c]==-1&&grid[x][y+1]==d)
				{
					dist[x][y+1][d][a][b][c]=D+1;
					q.push(x);
					q.push(y+1);
					q.push(d);
					q.push(a);
					q.push(b);
					q.push(c);
				}
			}
		}
		else
		{
			if(x>1)
			{
				if(dist[x-1][y-1][c][b][a][d]==-1&&grid[x-1][y-1]==c)
				{
					dist[x-1][y-1][c][b][a][d]=D+1;
					q.push(x-1);
					q.push(y-1);
					q.push(c);
					q.push(b);
					q.push(a);
					q.push(d);
				}
			}
			if(y>1)
			{
				if(dist[x][y-1][b][c][d][a]==-1&&grid[x][y-1]==b)
				{
					dist[x][y-1][b][c][d][a]=D+1;
					q.push(x);
					q.push(y-1);
					q.push(b);
					q.push(c);
					q.push(d);
					q.push(a);
				}
			}
			if(y<x+x-1)
			{
				if(dist[x][y+1][d][a][b][c]==-1&&grid[x][y+1]==d)
				{
					dist[x][y+1][d][a][b][c]=D+1;
					q.push(x);
					q.push(y+1);
					q.push(d);
					q.push(a);
					q.push(b);
					q.push(c);
				}
			}
		}
	}
	cout<<"-1\n";
	return 0;
}