#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int N, X, Y;
int A[210][210];

bool inside(int x, int y) {
  return (1 <= x && x <= N && 1 <= y && y <= 2*x-1);
}

int B[210][210];
int dist[210][210];

int main() {
  for (; ~scanf("%d", &N); ) {
    for (int x = 1; x <= N; ++x) {
      for (int y = 1; y <= 2*x-1; ++y) {
        scanf("%d", &A[x][y]);
      }
    }
    scanf("%d%d", &X, &Y);
    
    for (int x = 1; x <= N; ++x) {
      int b = (x & 1) ? 4 : 1;
      for (int y = 1; y <= 2*x-1; ++y) {
        B[x][y] = b;
        if (x & 1) {
          if (--b == 0) b = 4;
        } else {
          if (++b == 5) b = 1;
        }
      }
    }
    for (int x = 1; x <= N; ++x) {
      for (int y = 1; y <= 2*x-1; ++y) {
        if (A[x][y] != B[x][y]) B[x][y] = 0;
      }
// cerr<<x<<": ";pv(B[x]+1,B[x]+2*x);
    }
    
    queue<pair<int, int>> que;
    memset(dist, ~0, sizeof(dist));
    dist[1][1] = 0;
    que.emplace(1, 1);
    for (; que.size(); ) {
      const int x = que.front().first;
      const int y = que.front().second;
      que.pop();
// cerr<<x<<" "<<y<<": "<<dist[x][y]<<endl;
      auto go = [&](int xx, int yy) -> void {
        if (inside(xx, yy) && B[xx][yy]) {
          if (!~dist[xx][yy]) {
            dist[xx][yy] = dist[x][y] + 1;
            que.emplace(xx, yy);
          }
        }
      };
      go(x, y - 1);
      go(x, y + 1);
      if (y & 1) {
        go(x + 1, y + 1);
      } else {
        go(x - 1, y - 1);
      }
    }
    printf("%d\n", dist[X][Y]);
  }
  return 0;
}