#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T> std::istream& operator>>(std::istream& is, std::vector<T>& v) {
    for (auto& e : v) {
        is >> e;
    }
    return is;
}

template <class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
    for (std::string_view sep = ""; const auto& e : v) {
        os << std::exchange(sep, " ") << e;
    }
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) {
    return y < x and (x = std::forward<U>(y), true);
}

template <class T, class U = T> bool chmax(T& x, U&& y) {
    return x < y and (x = std::forward<U>(y), true);
}

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

using namespace std;

using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    int n;
    cin >> n;
    vector<vector<int>> a(n);
    for (int i = 0; i < n; i++) {
        a[i].resize(2 * i + 1);
        for (int j = 0; j < 2 * i + 1; j++) {
            cin >> a[i][j];
            a[i][j]--;
        }
    }

    vector<vector<int>> dp(n), b(n);
    for (int i = 0; i < n; i++) {
        dp[i].assign(2 * i + 1, -1);
        b[i].resize(2 * i + 1);
        for (int j = 0; j < 2 * i + 1; j++) {
            if (i & 1) {
                b[i][j] = j % 4;
            } else {
                b[i][j] = 3 - j % 4;
            }
        }
    }
    queue<pair<int, int>> que;
    dp[0][0] = 0;
    que.emplace(0, 0);
    while (not que.empty()) {
        auto [x, y] = que.front();
        que.pop();
        for (int dy : {-1, 1}) {
            int nx = x, ny = y + dy;
            if (ny < 0 or 2 * nx + 1 <= ny) continue;
            if (a[nx][ny] != b[nx][ny]) continue;
            if (dp[nx][ny] != -1) continue;
            dp[nx][ny] = dp[x][y] + 1;
            que.emplace(nx, ny);
        }
        {
            int nx, ny;
            if (y & 1) {
                nx = x - 1, ny = y - 1;
            } else {
                nx = x + 1, ny = y + 1;
            }
            if (nx < 0 or n <= nx) continue;
            if (ny < 0 or 2 * nx + 1 <= ny) continue;
            if (a[nx][ny] != b[nx][ny]) continue;
            if (dp[nx][ny] != -1) continue;
            dp[nx][ny] = dp[x][y] + 1;
            que.emplace(nx, ny);
        }
    }

    {
        int x, y;
        cin >> x >> y;
        cout << dp[--x][--y] << "\n";
    }
    return 0;
}