#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long
const int mxn = 100;

int n, g[mxn+2][mxn+2][mxn+2], vis[mxn+2][mxn+2][mxn+2];

int sx, sy, sz, ex, ey, ez;

signed main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
	cin >> n;
	cin >> sx >> sy >> sz >> ex >> ey >> ez;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			for (int k = 1; k <= n; k++) {
				char f; cin >> f;
				g[j][k][i] = '1'-f;
			}
		}
	}
	queue<array<int,4>> bfs;
	bfs.push({sx,sy,sz,0});
	while (!bfs.empty()) {
		auto f = bfs.front(); bfs.pop();
		int x = f[0], y = f[1], z = f[2], d = f[3];
		if (vis[x][y][z]) continue;
		if (!g[x][y][z]) continue;
		vis[x][y][z] = 1;
		if (x == ex && y == ey && z == ez) {
			cout << d; return 0;
		}
		d++;
		bfs.push({x+1,y,z,d});
		bfs.push({x-1,y,z,d});
		bfs.push({x,y+1,z,d});
		bfs.push({x,y-1,z,d});
		bfs.push({x,y,z+1,d});
		bfs.push({x,y,z-1,d});
	}
	cout << -1;
	
	return 0;
}