// Problem: B. Rolling Stones
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

// Author: Donomonayuas

#include <bits/stdc++.h>

#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T>inline void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T>inline void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

const int maxn = 210;

int n, dis[maxn][maxn][5][5][5][5], s[maxn][maxn];
queue<tuple<int, int, int, int, int, int>> q;

void check(int x, int y, int d, int a, int b, int c, int ds) {
  if (x < 1 || x > n || y < 1 || y > 2 * x - 1) return;
  if (d != s[x][y]) return;
  if (ds < dis[x][y][d][a][b][c]) {
    dis[x][y][d][a][b][c] = ds;
    q.emplace(x, y, d, a, b, c);
  }
}

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> n;
  rep (i, 1, n) rep (j, 1, 2 * i - 1) cin >> s[i][j];
  rep (i, 1, n) rep (j, 1, 2 * i - 1) {
    rep (d, 1, 4) rep (a, 1, 4) rep (b, 1, 4) rep (c, 1, 4) {
      dis[i][j][d][a][b][c] = 1e9;
    }
  }
  dis[1][1][4][2][1][3] = 0;
  q.emplace(1, 1, 4, 2, 1, 3);
  while (!q.empty()) {
    auto [x, y, d, a, b, c] = q.front();
    q.pop();
    // cerr << x << " " << y << " " << d << " " << a << " " << b << " " << c << endl;
    if (y & 1) {
      check(x, y - 1, b, c, a, d, dis[x][y][d][a][b][c] + 1);
      check(x, y + 1, c, b, d, a, dis[x][y][d][a][b][c] + 1);
      check(x + 1, y + 1, a, d, b, c, dis[x][y][d][a][b][c] + 1);
    } else {
      check(x, y - 1, b, c, a, d, dis[x][y][d][a][b][c] + 1);
      check(x, y + 1, c, b, d, a, dis[x][y][d][a][b][c] + 1);
      check(x - 1, y - 1, a, d, b, c, dis[x][y][d][a][b][c] + 1);
    }
  }
  // rep (d, 1, 4) rep (a, 1, 4) rep (b, 1, 4) rep (c, 1, 4) {
    // if (dis[1][1][d][a][b][c] != 1e9) cout << d << " " << a << " " << b << " " << c << endl;
  // }
  int ans = 1e9, x, y;
  cin >> x >> y;
  rep (d, 1, 4) rep (a, 1, 4) rep (b, 1, 4) rep (c, 1, 4) {
    chkmn(ans, dis[x][y][d][a][b][c]);
  }
  if (ans == 1e9) cout << "-1\n";
  else cout << ans << '\n';
}