#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(x) (x).begin(), (x).end()
bool be;
constexpr int N = 105;
int n, ok[N][N][N];
struct node {
	int x, y, z, d;
	node(int X, int Y, int Z, int D) {
		x = X, y = Y, z = Z, d = D;
	}
};
queue<node>q;
bool en;
int main()
{
	cerr << (&be - &en) / 1024.0 / 1024 << " MB\n--------------------------------" << endl;
#ifdef IAKIOI
	freopen("in.in", "r", stdin);
//	freopen("out.out", "w", stdout);
#endif
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, a, b, c, D, e, f;
	cin >> n >> a >> b >> c >> D >> e >> f;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) {
			for (int k = 1; k <= n; ++k) {
				char c;
				cin >> c;
				ok[j][k][i] = c == '1';
			}
		}
	}
	q.emplace(a, b, c, 0);
	while (!q.empty()) {
		auto [x, y, z, d] = q.front();
		q.pop();
		if (x == D && y == e && z == f) {
			cout << d << endl;
			return 0;
		}
		auto work = [&](int e, int f, int g) {
			if (1 <= e && e <= n && 1 <= f && f <= n && 1 <= g && g <= n && !ok[e][f][g]) {
				q.emplace(e, f, g, d + 1);
				ok[e][f][g] = 1;
			}
		};
		work(x + 1, y, z);
		work(x - 1, y, z);
		work(x, y + 1, z);
		work(x, y - 1, z);
		work(x, y, z + 1);
		work(x, y, z - 1);
	}
	cout << "-1\n";
	return 0;
}