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

#define int long long


int32_t main(){
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	int n;
	cin >> n;
	vector visited(n+1,vector(n+1,vector(n+1,false)));
	int xs,ys,zs,xe,ye,ze;
	cin >> xs >> ys >> zs >> xe >> ye >> ze;
	for(int k=1;k<=n;k++){
		for(int i=1;i<=n;i++){
			for(int j=1;j<=n;j++){
				char a;cin>>a;
				if(a=='1')visited[i][j][k]=true;
			}
		}
	}
	queue<pair<int,tuple<int,int,int>>> pq;
	pq.push({0ll,{xs,ys,zs}});
	while(!pq.empty()){
		auto [dist,pos] = pq.front();pq.pop();
		auto [x,y,z] = pos;
		if(visited[x][y][z])continue;
		visited[x][y][z]=true;
		if(x==xe and y==ye and z==ze){
			cout << dist << '\n';
			return 0;
		}
		if(x!=1 and !visited[x-1][y][z])pq.push({dist+1,{x-1,y,z}});
		if(x!=n and !visited[x+1][y][z])pq.push({dist+1,{x+1,y,z}});
		if(y!=1 and !visited[x][y-1][z])pq.push({dist+1,{x,y-1,z}});
		if(y!=n and !visited[x][y+1][z])pq.push({dist+1,{x,y+1,z}});
		if(z!=1 and !visited[x][y][z-1])pq.push({dist+1,{x,y,z-1}});
		if(z!=n and !visited[x][y][z+1])pq.push({dist+1,{x,y,z+1}});
	}
	cout << "-1\n";
}