#include <bits/stdc++.h>

#define int int64_t
using namespace std;

signed main() {
	cin.tie(0);
	ios_base::sync_with_stdio(0);
	int n;
	cin>>n;
	vector<vector<int> > correct(n);
	array<int,4> af = {0,1,0,1};
	for(int i=0; i<n; ++i) {
		correct[i]=vector<int>(2*i+1);
		correct[i][0] = af[i%4];
		for(int j=1; j<correct[i].size(); ++j) {
			if(i%2==0) {
				correct[i][j]=(4+correct[i][j-1]-1)%4;
			} else {
				correct[i][j]=(correct[i][j-1]+1)%4;
			}
		}
	}

	vector<vector<bool> > v(n);
	vector<vector<int> > d(n);
	const int inf = 1e9;
	for(int i=0; i<n; ++i) {
		v[i] = vector<bool>(2*i+1);
		d[i] = vector<int>(2*i+1,inf);
		for(int j=0; j<v[i].size(); ++j){
			int t;
			cin>>t;t%=4;
			v[i][j]=t==correct[i][j];
		}
	}
	int row,col;
	cin>>row>>col;--row;--col;
	queue<array<int,2> > q;
	if(v[0][0]) {
		d[0][0]=0;
		q.push({0,0});
	}
	while(!q.empty()) {
		auto [i,j] = q.front();
		q.pop();
		if(j%2==1 && d[i-1][j-1]==inf && v[i-1][j-1]) {
			d[i-1][j-1]=d[i][j]+1;
			q.push({i-1,j-1});
		}
		if(i<n-1 && j%2==0 && d[i+1][j+1]==inf && v[i+1][j+1]) {
			d[i+1][j+1]=d[i][j]+1;
			q.push({i+1,j+1});
		}
		if(j && d[i][j-1]==inf && v[i][j-1]) {
			d[i][j-1]=d[i][j]+1;
			q.push({i,j-1});
		}
		if(j+1 < 2*i+1 && d[i][j+1]==inf && v[i][j+1]) {
			d[i][j+1]=d[i][j]+1;
			q.push({i,j+1});
		}
	}
	if(d[row][col]==inf) cout<<"-1"<<endl;
	else cout<<d[row][col]<<endl;
	return 0;
}