#include <cstdio>
#include <cstring>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#include <cctype>
#include <set>

namespace uvu
{
#define LOCAL ____________DONT_DEFINE_ME____________
#define ll long long
#define inf 0x3f3f3f3f
// #define int long long
// #define inf 0x3f3f3f3f3f3f3f3fll
#define infll 0x3f3f3f3f3f3f3f3fll
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define gline debug("now is #%d\n", __LINE__)
#define pii std::pair <int, int>
#define mkp std::make_pair
#define fi first
#define se second
char _ST_;
const int BUFSIZE = (1 << 20);
char ibuf[BUFSIZE], *iS = ibuf, *iT = ibuf;
char obuf[BUFSIZE], *oS = obuf, *oT = obuf + BUFSIZE;
char getc()
{
#ifdef LOCAL
	return getchar();
#else
	if(iS == iT) iT = (iS = ibuf) + fread(ibuf, 1, BUFSIZE, stdin);
	return iS == iT ? EOF : *iS++;
#endif
#define getchar ERR
}

void Flush() { fwrite(obuf, 1, oS - obuf, stdout); oS = obuf; }
struct Flusher { ~Flusher(){ Flush(); } }iamflusher;

void putc(char c)
{
#ifdef LOCAL
	putchar(c);
#else
	*oS++ = c;
	if(oS == oT) Flush();
#endif
#define putchar ERR
}

template <typename T = int> T read()
{
	T x = 0, f = 1; char c = getc();
	for(; !isdigit(c); c = getc()) if(c == '-') f = -1;
	for(;  isdigit(c); c = getc()) x = (x << 3) + (x << 1) + (c ^ 48);
	return x * f;
}

template <typename T> void print(T x, char c)
{
static int sta[BUFSIZE], top;
	top = 0;
	if(x < 0) putc('-'), x = -x;
	if(!x) sta[top = 1] = 0;
	for(; x; x /= 10) sta[++top] = x % 10;
	for(; top; ) putc(sta[top--] ^ 48);
	if(c) putc(c);
}

int readstr(char *s, int base)
{
	int idx = base - 1; char c = getc();
	for(; !(isdigit(c) || isalpha(c) || c == '#' || c == '.'); c = getc());
	for(;   isdigit(c) || isalpha(c) || c == '#' || c == '.' ; c = getc()) s[++idx] = c;
	return idx - base + 1;
}

void printf(const char *s) { for(; *s; s++) putc(*s); }
template <typename T, typename ... Args>
void printf(const char *s, T x, Args ... rest)
{
	for(; *s; s++)
	{
		if(*s != '%') { putc(*s); continue; }
		s++; if(*s == 'd') print(x, 0);
		else if(*s == 'c') putc(x);
		printf(s + 1, rest ...);
		return;
	}
}

template <typename T> void ckmax(T &x, T y) { x = x > y ? x : y; }
template <typename T> void ckmin(T &x, T y) { x = x < y ? x : y; }
#define mod 998244353
// #define mod 1000000007
int sm(int x) { return x >= mod ? x - mod : x; }
void plus_(int &x, int y) { x = x + y; }
void mul_(int &x, int y) { x = 1ll * x * y % mod; }
int ksm(int a, int b) { int res = 1; for(; b; b >>= 1, mul_(a, a)) if(b & 1) mul_(res, a); return res; }

#define N 310
int n, Tx, Ty;
int a[N][N];
int dis[N][N][5][5][5][5];

struct node
{
	int x, y, front, left, right, down;
};
std::queue <node> q;

void solve()
{
	// memset(h, idx = -1, sizeof(h));
	memset(dis, -1, sizeof(dis));
	n = read();
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= i * 2 - 1; j++)
			a[i][j] = read();
	q.push((node){1, 1, 2, 1, 3, 4});
	dis[1][1][2][1][3][4] = 0;
	while(!q.empty())
	{
		auto t = q.front(); q.pop();
		int v = dis[t.x][t.y][t.front][t.left][t.right][t.down];
		auto upd = [&](int x, int y, int f, int l, int r, int d) -> void
		{
			if(!(1 <= x && x <= n)) return;
			if(!(1 <= y && y <= x * 2 - 1)) return;
			if(d != a[x][y]) return;
			if(!~dis[x][y][f][l][r][d])
				dis[x][y][f][l][r][d] = v + 1, q.push((node){x, y, f, l, r, d});
		};
		if(t.y & 1)
		{
			upd(t.x, t.y + 1, t.left, t.down, t.front, t.right);
			upd(t.x, t.y - 1, t.right, t.front, t.down, t.left);
			upd(t.x + 1, t.y + 1, t.down, t.left, t.right, t.front);
		}
		else
		{
			upd(t.x, t.y + 1, t.left, t.down, t.front, t.right);
			upd(t.x, t.y - 1, t.right, t.front, t.down, t.left);
			upd(t.x - 1, t.y - 1, t.down, t.left, t.right, t.front);
		}
	}
	Tx = read(), Ty = read();
	int res = inf;
	for(int i = 1; i <= 4; i++)
	for(int j = 1; j <= 4; j++)
	for(int k = 1; k <= 4; k++)
	for(int p = 1; p <= 4; p++) if(~dis[Tx][Ty][i][j][k][p])
		ckmin(res, dis[Tx][Ty][i][j][k][p]);
	if(res == inf) print(-1, '\n');
	else print(res, '\n');
}

void init()
{

}

char _ED_;

void mian()
{
	debug("%.3f MB\n", abs(&_ST_ - &_ED_) / 1024.0 / 1024);
	init();
	for(int T = 1; T; solve(), T--);
}

#ifdef int
	#undef int
#endif
}

int main()
{
	//freopen("tmp.in", "r", stdin);
	//freopen("tmp.out", "w", stdout);
	uvu::mian(); return 0;
}