#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;

const int N = 210, M = N * N * 6, SZ = (1 << 18) + 5;
static char buf[SZ], *bgn = buf, *til = buf;
char getc() {
    if(bgn == til)  bgn = buf, til = buf + fread(buf, 1, SZ, stdin);
    return bgn == til ? EOF : *bgn++;
}
template<typename T>
void read(T &x) {
    char ch = getc();  T fh = 0;   x = 0;
    while(ch < '0' || ch > '9')    fh |= (ch == '-'), ch = getc();
    while(ch >= '0' && ch <= '9')   x = x * 10 + ch - '0', ch = getc();
    x = fh ? -x : x;
}
template<typename Type, typename... argc>
void read(Type &x, argc &...args)   {read(x), read(args...);}
template<typename T>
void print(T x) {
    if(x < 0)  putchar('-'), x = -x;
    if(x / 10)  print(x / 10);
    putchar(x % 10 + '0');
}
int n, a[N][N], ans = M, edx, edy, num[5][5], dis[M];
vector<int> edge[M];
int check(int x, int y) {
    return x > 0 && y > 0 && x <= n && y < x + x;
}
int id(int x, int y, int pos) {
    return ((x - 1) * (x - 1) + y - 1) * 6 + pos + 1;
}
void bfs() {
    memset(dis, 0x3f, sizeof(dis));
    queue<int> q;   dis[id(1, 1, 2)] = 0, q.push(id(1, 1, 2));
    while(!q.empty()) {
        int x = q.front();  q.pop();
        // cerr << x << " " << dis[x] << "\n";
        for(int y : edge[x])
            if(dis[y] > dis[x] + 1) dis[y] = dis[x] + 1, q.push(y);
    }
}
int main() {
    #ifdef Kelly
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        freopen("err.txt", "w", stderr);
    #endif
    read(n);
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j < i + i; ++j)  read(a[i][j]);
    read(edx, edy);
    for(int i = 1; i <= 4; ++i) {
        int nw = 0;
        for(int j = 1; j <= 4; ++j) if(i != j)  num[i][j] = nw++;
    }
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j < i + i; ++j) {
            int ps = (j & 1) ? 1 : -1, fl = a[i][j];
            for(int k = 1; k <= 4; ++k) {
                if(k == fl)    continue;
                vector<int> tmp;    
                for(int v = 1; v <= 4; ++v) if(v != a[i][j] && v != k)  tmp.pb(v);
                for(int op : {0, 1}) {
                    int l = tmp[0], r = tmp[1];
                    if(op)  swap(l, r);
                    if(check(i + ps, j + ps) && a[i + ps][j + ps] == k) {
                        edge[id(i, j, num[fl][k] * 2 + op)].pb(id(i + ps, j + ps, num[a[i + ps][j + ps]][fl] * 2 + op));
                        // cerr << i << " " << j << " " << num[fl][k] * 2 + op << " " << id(i, j, num[fl][k] * 2 + op) << " 1\n"; 
                    }
                    if(check(i, j - 1) && a[i][j - 1] == l) {
                        edge[id(i, j, num[fl][k] * 2 + op)].pb(id(i, j - 1, num[a[i][j - 1]][r] * 2 + (k > fl)));
                        // cerr << i << " " << j << " " << num[fl][k] * 2 + op << " " << id(i, j, num[fl][k] * 2 + op) << " 2\n"; 
                    }
                    if(check(i, j + 1) && a[i][j + 1] == r) {
                        edge[id(i, j, num[fl][k] * 2 + op)].pb(id(i, j + 1, num[a[i][j + 1]][l] * 2 + (fl > k)));
                        // cerr << i << " " << j << " " << num[fl][k] * 2 + op << " " << id(i, j, num[fl][k] * 2 + op) << " 3\n"; 
                    }
                }
            }
        }
    // for(int x : edge[17])   cerr << x << " ";
    // cerr << "\n";
    bfs();
    // cerr << id(edx, edy, 0) << " " << id(edx, edy, 5) << "\n";
    for(int i = id(edx, edy, 0); i <= id(edx, edy, 5); ++i) ans = min(ans, dis[i]);
    cout << (ans > n * n ? -1 : ans);
    return 0;
}