#include <fstream>
#include <queue>
#include <tuple>

using namespace std;

ifstream cin("car.in");
ofstream cout("car.out");

int v[505][505];
int dl[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dc[8] = {0, 1, 1, 1, 0, -1, -1, -1};
queue <tuple<int, int, int, int>> q;

int main()
{
    int n, m, a, b, x, y;
    cin>>n>>m>>x>>y>>a>>b;
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=m; j++)
        {
            cin>>v[i][j];
            v[i][j]*=-1;
            if(v[i][j]==0)
            {
                v[i][j]=1000005;
            }
        }
    }
    for(int i=0; i<=n; i++)
    {
        v[i][0]=v[i][m+1]=-1;
    }
    for(int j=0; j<=m; j++)
    {
        v[0][j]=v[n+1][j]=-1;
    }
    for(int i=0; i<8; i++)
    {
        if(v[x+dl[i]][y+dc[i]]!=-1)
        {
            v[x+dl[i]][y+dc[i]] = 0;
            q.push({x+dl[i], y+dc[i], 0, i});
        }
    }
    v[x][y]=0;
    int cnt=0, dir=0, urm=0;
    while(!q.empty())
    {
        x=get<0>(q.front());
        y=get<1>(q.front());
        cnt=get<2>(q.front());
        dir=get<3>(q.front());
        q.pop();
        for(int i=0; i<8; i++)
        {
            if(v[x+dl[i]][y+dc[i]]!=-1)
            {
                urm = abs(i-dir);
                urm = min(urm, 8 - urm);
                //cout << v[x+dl[i]][y+dc[i]]<<" ";
                if(urm<3 && v[x+dl[i]][y+dc[i]]>urm+cnt){
                    v[x+dl[i]][y+dc[i]] = urm+cnt;
                    q.push({x+dl[i], y+dc[i], cnt+urm, i});
                }
            }
        }
    }
    cout<<v[a][b];

    return 0;
}