#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

void Solve() {
  int n;
  IN(n);
  vector<vector<int>> a(n);
  vector<vector<bool>> good(n);
  for (int i : Rep(0, n)) {
    a[i].resize(2 * i + 1);
    IN(a[i]);
    good[i].resize(2 * i + 1);
    for (int j : Rep(0, 2 * i + 1)) {
      if (i % 2 == 0) {
        good[i][j] = a[i][j] == 4 - j % 4;
      } else {
        good[i][j] = a[i][j] == j % 4 + 1;
      }
    }
  }
  int ti, tj;
  IN(ti, tj);
  --ti, --tj;
  vector<vector<int>> d(n);
  for (int i : Rep(0, n)) {
    d[i].resize(2 * i + 1, INF);
  }
  vector<pair<int, int>> q;
  d[0][0] = 0;
  q.emplace_back(0, 0);
  for (int qi = 0; qi < Sz(q); ++qi) {
    auto [i, j] = q[qi];
    auto Go = [&](int ni, int nj) {
      if (ni < 0 || n <= ni) {
        return;
      }
      if (nj < 0 || Sz(a[ni]) <= nj) {
        return;
      }
      if (!good[ni][nj]) {
        return;
      }
      if (SetMin(d[ni][nj], d[i][j] + 1)) {
        q.emplace_back(ni, nj);
      }
    };
    Go(i, j - 1);
    Go(i, j + 1);
    if (j % 2 == 0) {
      Go(i + 1, j + 1);
    }
    if (j % 2 == 1) {
      Go(i - 1, j - 1);
    }
  }
  OUT(d[ti][tj] < INF ? d[ti][tj] : -1);
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  Solve();
}

#elif __INCLUDE_LEVEL__ == 1

#include <bits/stdc++.h>

template <class T> concept Range = std::ranges::range<T> && !std::convertible_to<T, std::string_view>;
template <class T> concept Tuple = std::__is_tuple_like<T>::value && !Range<T>;

namespace std {

istream& operator>>(istream& is, Range auto&& r) {
  for (auto&& e : r) is >> e;
  return is;
}
istream& operator>>(istream& is, Tuple auto&& t) {
  apply([&](auto&... xs) { (is >> ... >> xs); }, t);
  return is;
}

ostream& operator<<(ostream& os, Range auto&& r) {
  auto sep = "";
  for (auto&& e : r) os << exchange(sep, " ") << e;
  return os;
}
ostream& operator<<(ostream& os, Tuple auto&& t) {
  auto sep = "";
  apply([&](auto&... xs) { ((os << exchange(sep, " ") << xs), ...); }, t);
  return os;
}

}  // namespace std

using namespace std;

#define LAMBDA2(x, y, ...) ([&](auto&& x, auto&& y) -> decltype(auto) { return __VA_ARGS__; })
#define Rep(...) [](int l, int r) { return views::iota(min(l, r), r); }(__VA_ARGS__)
#define Sz(r) int(size(r))
#define SetMin(...) LAMBDA2(x, y, y < x && (x = y, 1))(__VA_ARGS__)
#define INF (INT_MAX / 2)
#define IN(...) (cin >> forward_as_tuple(__VA_ARGS__))
#define OUT(...) (cout << forward_as_tuple(__VA_ARGS__) << '\n')

#endif  // __INCLUDE_LEVEL__ == 1