#include <array>
#include <iomanip>
#include <iostream>
#include <utility>
#include <vector>

constexpr int inf = 114514;

int main() {
    std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0);

    int n;
    std::cin >> n;

    std::vector G(n, std::vector<int>(n * 2 + 2, 0));
    std::vector<int> pos(n, 0);
    std::vector id(n, std::vector<int>(n * 2 + 2, -1));
    std::vector<std::pair<int, int>> di;
    int tot = 0;
    for (int i = 0; i < n; i++) {
        pos[i] = n - 1 - i;
        for (int j = 0; j < i * 2 + 1; j++) {
            std::cin >> G[i][pos[i] + j];
            id[i][j + pos[i]] = tot++;
            di.push_back({i, pos[i] + j});
        }
    }

    int x, y;
    std::cin >> x >> y;
    x--, y--, y += pos[x];

    std::vector<int> dist(tot, inf);
    std::vector<int> vis(tot, 0);
    dist[0] = 0;
    vis[0]  = 1;

    // fx: 1=left, 2=right, 3=head, 4=ground
    // head: 0=down, 1=up
    using P  = std::pair<int, int>;
    using A  = std::array<int, 5>;
    auto dfs = [&](auto f, P pos, A face, int head) -> void {
        auto [i, j] = pos;

        if (j > 0 && G[i][j - 1] != 0 && !vis[id[i][j - 1]]) {
            if (face[G[i][j - 1]] == 1 &&
                dist[id[i][j - 1]] > dist[id[i][j]] + 1) {

                A ff;
                std::copy(face.begin(), face.end(), ff.begin());
                for (int x = 1; x <= 4; x++) {
                    if (ff[x] == 1) ff[x] = 4;
                    else if (ff[x] == 2) ff[x] = 3;
                    else if (ff[x] == 3) ff[x] = 1;
                    else if (ff[x] == 4) ff[x] = 2;
                }

                dist[id[i][j - 1]] = dist[id[i][j]] + 1;
                vis[id[i][j - 1]]  = 1;
                f(f, {i, j - 1}, ff, 1- head);
                vis[id[i][j - 1]] = 0;
            }
        }

        if (j < n * 2 + 1 && G[i][j + 1] != 0 && !vis[id[i][j + 1]]) {
            if (face[G[i][j + 1]] == 2 &&
                dist[id[i][j + 1]] > dist[id[i][j]] + 1) {

                A ff;
                std::copy(face.begin(), face.end(), ff.begin());
                for (int x = 1; x <= 4; x++) {
                    if (ff[x] == 1) ff[x] = 3;
                    else if (ff[x] == 2) ff[x] = 4;
                    else if (ff[x] == 3) ff[x] = 2;
                    else if (ff[x] == 4) ff[x] = 1;
                }
                
                dist[id[i][j + 1]] = dist[id[i][j]] + 1;
                vis[id[i][j + 1]]  = 1;
                f(f, {i, j + 1}, ff, 1 - head);
                vis[id[i][j + 1]] = 0;
            }
        }

        if (i < n - 1 && G[i + 1][j] != 0 && !vis[id[i + 1][j]]) {
            if (face[G[i + 1][j]] == 3 && head == 1 &&
                dist[id[i + 1][j]] > dist[id[i][j]] + 1) {

                A ff;
                std::copy(face.begin(), face.end(), ff.begin());
                for (int x = 1; x <= 4; x++) {
                    if (ff[x] == 1) ff[x] = 1;
                    else if (ff[x] == 2) ff[x] = 2;
                    else if (ff[x] == 3) ff[x] = 4;
                    else if (ff[x] == 4) ff[x] = 3;
                }
                
                dist[id[i + 1][j]] = dist[id[i][j]] + 1;
                vis[id[i + 1][j]]  = 1;
                f(f, {i + 1, j}, ff, 1 - head);
                vis[id[i + 1][j]] = 0;
            }
        }

        if (i > 0 && G[i - 1][j] != 0 && !vis[id[i - 1][j]]) {
            // std::cout << i << ' ' << j << ':' << face[G[i - 1][j]] << '\n';
            if (face[G[i - 1][j]] == 3 && head == 0 &&
                dist[id[i - 1][j]] > dist[id[i][j]] + 1) {
                A ff;
                std::copy(face.begin(), face.end(), ff.begin());
                for (int x = 1; x <= 4; x++) {
                    if (ff[x] == 1) ff[x] = 1;
                    else if (ff[x] == 2) ff[x] = 2;
                    else if (ff[x] == 3) ff[x] = 4;
                    else if (ff[x] == 4) ff[x] = 3;
                }
                
                dist[id[i - 1][j]] = dist[id[i][j]] + 1;
                vis[id[i - 1][j]]  = 1;
                f(f, {i - 1, j}, ff, 1 - head);
                vis[id[i - 1][j]] = 0;
            }
        }
    };

    dfs(dfs, di[0], {0, 1, 3, 2, 4}, 1);
    std::cout << (dist[id[x][y]] == inf ? -1 : dist[id[x][y]]) << '\n';

    // for (int i = 0; i < n; i++) {
    //     for (int j = 0; j < pos[i] + i * 2 + 1; j++) {
    //         if (j < pos[i]) std::cout << "XXXXX ";
    //         else
    //             std::cout << std::setw(2) << G[i][j] << std::setw(3)
    //                       << (dist[id[i][j]] == inf ? -1 : dist[id[i][j]])
    //                       << ' ';
    //     }
    //     std::cout << '\n';
    // }
}