#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int N = 105;

struct edge {
	int to, Next;

	edge() {}
	edge(int to, int Next): to(to), Next(Next) {}
} G[N * N * N];

int head[N * N * N], cnt;

inline void add_edge(int u, int v) {
	G[++cnt] = edge(v, head[u]);
	head[u] = cnt;
}

int n, a[N][N * 2], b[N][N * 2], dis[N * N * N];

inline int f(int x, int y) {
	return x * 2 * n + y;
}

inline int X(int p) {
	return p / (2 * n);
}

inline int Y(int p) {
	return p % (2 * n);
}

inline bool check0(int p) {
	return a[X(p)][Y(p)] == b[X(p)][Y(p)];
}

inline void bfs(int s, int t) {
	if (!check0(s)) {
		cout << "-1\n";
		return;
	}
	queue <int> Q;
	dis[s] = 1;
	Q.push(s);
	while (!Q.empty()) {
		int u = Q.front();
		Q.pop();
		for (int i = head[u]; i; i = G[i].Next) {
			int v = G[i].to;
			if (dis[v] == 0 && check0(v)) {
				dis[v] = dis[u] + 1;
				Q.push(v);
			}
		}
	}
	cout << dis[t] - 1 << "\n";
}

int main() {
	#ifdef LOCAL
		assert(freopen("test.in", "r", stdin));
		assert(freopen("test.out", "w", stdout));
	#endif
	ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		if (i & 1) {
			for (int j = 1, k = 4; j <= (i << 1) - 1; ++j, k = ((k == 1) ? 4 : (k - 1))) {
				a[i][j] = k;
			}
		} else {
			for (int j = 1, k = 1; j <= (i << 1) - 1; ++j, k = ((k == 4) ? 1 : (k + 1))) {
				a[i][j] = k;
			}
		}
	}
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= (i << 1) - 1; ++j) {
			cin >> b[i][j];
		}
	}
	for (int i = 1; i < n; ++i) {
		for (int j = 1; j <= (i << 1) - 1; j += 2) {
			add_edge(f(i, j), f(i + 1, j + 1));
			add_edge(f(i + 1, j + 1), f(i, j));
		}
	}
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j < (i << 1) - 1; ++j) {
			add_edge(f(i, j), f(i, j + 1));
			add_edge(f(i, j + 1), f(i, j));
		}
	}
	int tx, ty;
	cin >> tx >> ty;
	bfs(f(1, 1), f(tx, ty));
	return 0;
}