#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>

using namespace std;

// BEGIN NO SAD
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
typedef vector<int> vi;
#define f first
#define s second
#define derr if(1) cerr

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << flush;
// END NO SAD

template<class Fun>
class y_combinator_result {
  Fun fun_;
public:
  template<class T>
  explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}

  template<class ...Args>
  decltype(auto) operator()(Args &&...args) {
    return fun_(std::ref(*this), std::forward<Args>(args)...);
  }
};

template<class Fun>
decltype(auto) y_combinator(Fun &&fun) {
  return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}

template<class T>
bool updmin(T& a, T b) {
  if(b < a) {
    a = b;
    return true;
  }
  return false;
}
template<class T>
bool updmax(T& a, T b) {
  if(b > a) {
    a = b;
    return true;
  }
  return false;
}
typedef int64_t ll;
typedef long double ld;

typedef array<int, 4> trifacedown; // left, down, right, bottom
typedef array<int, 4> trifaceup; // left, up, right, bottom

trifaceup downmovedown(trifacedown x) {
  return {x[0], x[3], x[2], x[1]};
}
trifaceup downmoveleft(trifacedown x) {
  return {x[1], x[2], x[3], x[0]};
}
trifaceup downmoveright(trifacedown x) {
  return {x[3], x[0], x[1], x[2]};
}

trifacedown upmoveup(trifaceup x) {
  return {x[0], x[3], x[2], x[1]};
}
trifacedown upmoveleft(trifaceup x) {
  return {x[1], x[2], x[3], x[0]};
}
trifacedown upmoveright(trifaceup x) {
  return {x[3], x[0], x[1], x[2]};
}

void sanity() {
  trifacedown init = {1, 2, 3, 4};
  trifaceup cand = downmoveright(init);
  trifacedown rhs = upmoveleft(cand);
  assert(init == rhs);
}
void solve() {
  sanity();
  int n;
  cin >> n;
  vector<vector<int>> g(n);
  vector<vector<int>> dp(n);
  for(int i = 0; i < n; i++) {
    g[i].resize(2*i+1);
    dp[i].assign(2*i+1, 1e9);
    for(auto& x: g[i]) cin >> x;
  }
  dp[0][0] = 0;
  int dstx, dsty;
  cin >> dstx >> dsty; dstx--; dsty--;
  queue<array<int, 6>> q;
  q.push({0, 0, 1, 2, 3, 4});
  while(sz(q)) {
    auto [x, y, a, b, c, d] = q.front(); q.pop();
    assert(g[x][y] == d);
    if(x == dstx && y == dsty) {
      return void(cout << dp[x][y] << "\n");
    }
    if(y%2 == 0) {
      trifacedown init = {a, b, c, d};
      // try to go down
      if(x+1 < n && dp[x+1][y+1] > 1 + dp[x][y]) {
        trifaceup cand = downmovedown(init);
        if(cand[3] == g[x+1][y+1]) {
          dp[x+1][y+1] = 1 + dp[x][y];
          q.push({x+1, y+1, cand[0], cand[1], cand[2], cand[3]});
        }
      }
      // try to go left
      if(y > 0 && dp[x][y-1] > 1 + dp[x][y]) {
        trifaceup cand = downmoveleft(init);
        if(cand[3] == g[x][y-1]) {
          dp[x][y-1] = 1 + dp[x][y];
          q.push({x, y-1, cand[0], cand[1], cand[2], cand[3]});
        }
      }
      // try to go right
      if(y+1 < sz(g[x]) && dp[x][y+1] > 1 + dp[x][y]) {
        trifaceup cand = downmoveright(init);
        if(cand[3] == g[x][y+1]) {
          dp[x][y+1] = 1 + dp[x][y];
          q.push({x, y+1, cand[0], cand[1], cand[2], cand[3]});
        }
      }
    }
    else {
      assert(y%2 == 1);
      trifaceup init = {a, b, c, d};
      // try to go yp
      if(x-1 >= 0 && y-1 >= 0 && dp[x-1][y-1] > 1 + dp[x][y]) {
        trifacedown cand = upmoveup(init);
        if(cand[3] == g[x-1][y-1]) {
          dp[x-1][y-1] = 1 + dp[x][y];
          q.push({x-1, y-1, cand[0], cand[1], cand[2], cand[3]});
        }
      }
      // try to go left
      if(y > 0 && dp[x][y-1] > 1 + dp[x][y]) {
        trifacedown cand = upmoveleft(init);
        if(cand[3] == g[x][y-1]) {
          dp[x][y-1] = 1 + dp[x][y];
          q.push({x, y-1, cand[0], cand[1], cand[2], cand[3]});
        }
      }
      // try to go right
      if(y+1 < sz(g[x]) && dp[x][y+1] > 1 + dp[x][y]) {
        trifacedown cand = upmoveright(init);
        if(cand[3] == g[x][y+1]) {
          dp[x][y+1] = 1 + dp[x][y];
          q.push({x, y+1, cand[0], cand[1], cand[2], cand[3]});
        }
      }
    }
  }
  cout << "-1\n";
}

// what would chika do
// are there edge cases (N=1?)
// are array sizes proper (scaled by proper constant, for example 2* for koosaga tree)
// integer overflow?
// DS reset properly between test cases
// are you doing geometry in floating points
// are you not using modint when you should

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
}