#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;

#define all(a) begin(a), end(a)
#define len(a) int((a).size())

constexpr int N = 111;
constexpr int INF = 1e9;

int dist[N][2 * N][4][4][4];

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int n;
    cin >> n;

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

        for (int j = 0; j < len(a[i]); j++) {
            for (int x : {0, 1, 2, 3}) {
                for (int y : {0, 1, 2, 3}) {
                    for (int z : {0, 1, 2, 3}) {
                        dist[i][j][x][y][z] = INF;
                    }
                }
            }
        }
    }

    int dest_x, dest_y;
    cin >> dest_x >> dest_y;
    dest_x--, dest_y--;

    queue<tuple<int, int, int, int, int>> que;
    que.emplace(0, 0, 1, 0, 2);
    dist[0][0][1][0][2] = 0;

    while (!que.empty()) {
        auto [i, j, x, y, z] = que.front();
        que.pop();
        int another = (0 + 1 + 2 + 3) - x - y - z;
        int cur_dist = dist[i][j][x][y][z];

        auto update = [&](int i2, int j2, int x2, int y2, int z2) {
            if (i2 >= n || i2 < 0 || j2 < 0 || j2 >= len(a[i2])) {
                return;
            }

            int bottom = (0 + 1 + 2 + 3) - x2 - y2 - z2;
            if (bottom != a[i2][j2]) {
                return;
            }

            if (dist[i2][j2][x2][y2][z2] > cur_dist + 1) {
                dist[i2][j2][x2][y2][z2] = cur_dist + 1;
                que.emplace(i2, j2, x2, y2, z2);
            }
        };

        update(i, j - 1, z, x, another);
        update(i, j + 1, y, another, x);
        if (j % 2 == 0) {
            update(i + 1, j + 1, another, y, z);
        } else {
            update(i - 1, j - 1, another, y, z);
        }
    }

    int ans = INF;
    for (int x : {0, 1, 2, 3}) {
        for (int y : {0, 1, 2, 3}) {
            for (int z : {0, 1, 2, 3}) {
                ans = min(ans, dist[dest_x][dest_y][x][y][z]);
            }
        }
    }

    if (ans > INF / 2) {
        ans = -1;
    }
    cout << ans << '\n';
}