#line 1 "B.cpp"
// #pragma GCC target("avx2,avx512f,avx512vl,avx512bw,avx512dq,avx512cd,avx512vbmi,avx512vbmi2,avx512vpopcntdq,avx512bitalg,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("Ofast")

#line 2 "/home/sigma/comp/library/template.hpp"

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) int(x.size())
#define pb push_back
#define eb emplace_back
#define fs first
#define sc second
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
template<class T,class U> bool chmax(T& x, U y){
	if(x<y){ x=y; return true; }
	return false;
}
template<class T,class U> bool chmin(T& x, U y){
	if(y<x){ x=y; return true; }
	return false;
}
template<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}
template<class T> int lwb(const V<T>& v, const T& a){return lower_bound(all(v),a) - v.begin();}
template<class T>
V<T> Vec(size_t a) {
    return V<T>(a);
}
template<class T, class... Ts>
auto Vec(size_t a, Ts... ts) {
  return V<decltype(Vec<T>(ts...))>(a, Vec<T>(ts...));
}
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
void dmpr(ostream& os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ~ ";
	dmpr(os,args...);
}
#define shows(...) cerr << "LINE" << __LINE__ << " : ";dmpr(cerr,##__VA_ARGS__)
#define dump(x) cerr << "LINE" << __LINE__ << " : " << #x << " = {";  \
	for(auto v: x) cerr << v << ","; cerr << "}" << endl;
#else
#define show(x) void(0)
#define dump(x) void(0)
#define shows(...) void(0)
#endif

template<class D> D divFloor(D a, D b){
	return a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0);
}
template<class D> D divCeil(D a, D b) {
	return a / b + (((a ^ b) > 0 && a % b != 0) ? 1 : 0);
}
#line 5 "B.cpp"

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);		//DON'T USE scanf/printf/puts !!
	cout << fixed << setprecision(20);

	int N; cin >> N;
	VV<int> A(N);
	rep(x,N){
		A[x].resize(x*2+1);
		rep(y,x*2+1){
			cin >> A[x][y];
			A[x][y]--;
		}
	}
	int tx,ty; cin >> tx >> ty; tx--,ty--;

	queue<vector<int>> q;
	map<vector<int>,int> dist;
	auto push = [&](int x, int y, int p0, int p1, int p2, int p3, int d){
		if(x < 0 || x >= N || y < 0 || y >= x*2+1) return;
		if(p0 != A[x][y]) return;
		if(x == tx && y == ty){
			cout << d << endl;
			exit(0);
		}
		V<int> v = {x,y,p0,p1,p2,p3};
		if(dist.count(v)) return;
		dist[v] = d;
		q.push(v);
	};
	push(0,0,3,1,2,0,0);
	while(!q.empty()){
		auto v = q.front(); q.pop();
		int d = dist[v];
		int x = v[0], y = v[1];
		V<int> p = {v[2],v[3],v[4],v[5]};
		if(y%2 == 0){
			push(x,y-1,p[3],p[2],p[1],p[0],d+1);
			push(x,y+1,p[2],p[3],p[0],p[1],d+1);
			push(x+1,y+1,p[1],p[0],p[3],p[2],d+1);
		}else{
			push(x-1,y-1,p[1],p[0],p[3],p[2],d+1);
			push(x,y-1,p[2],p[3],p[0],p[1],d+1);
			push(x,y+1,p[3],p[2],p[1],p[0],d+1);
		}
	}
	cout << -1 << endl;
}