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

using namespace std;

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

int v[505][505][8];
int dl[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dc[8] = {0, 1, 1, 1, 0, -1, -1, -1};

vector <queue <tuple<int, int, int>>> q(3);

int main()
{
    int n, m, a, b, x, y, exitcond=0, cnt=0, dir=0;
    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][0];
            if(v[i][j][0]==0)
            {
                v[i][j][0]=v[i][j][1]=v[i][j][2]=v[i][j][3]=v[i][j][4]=v[i][j][5]=v[i][j][6]=v[i][j][7]=-2;
            }
        }
    }
    for(int i=0; i<=n; i++)
    {
        for(int j=0; j<8; j++)
            v[i][0][j]=v[i][m+1][j]=-1;
    }
    for(int j=0; j<=m; j++)
    {
        for(int i=0; i<8; i++)
            v[0][j][i]=v[n+1][j][i]=-1;
    }
    v[x][y][0]=v[x][y][1]=v[x][y][2]=v[x][y][3]=v[x][y][4]=v[x][y][5]=v[x][y][6]=v[x][y][7]=-1;
    for(int i=0; i<8; i++)
    {
        if(v[x+dl[i]][y+dc[i]][i]==-2)
        {
            v[x+dl[i]][y+dc[i]][i] = 1;
            q[0].push({x+dl[i], y+dc[i], i});
        }
    }
    while(exitcond == 0)
    {
        if(q[0].empty() && q[1].empty() && q[2].empty())
        {
            break;
        }
        if(q[cnt%3].empty())
        {
            cnt++;
        }
        if(q[cnt%3].empty())
        {
            cnt++;
        }
        x=get<0>(q[cnt%3].front());
        y=get<1>(q[cnt%3].front());
        dir=get<2>(q[cnt%3].front());
        q[cnt%3].pop();
        v[x][y][dir]=cnt;

        if(v[x+dl[dir]][y+dc[dir]][dir]==-2)
        {
            //v[x+dl[dir]][y+dc[dir]] = cnt;
            q[cnt%3].push({x+dl[dir], y+dc[dir], dir});
        }
        if(v[x+dl[(dir+1)%8]][y+dc[(dir+1)%8]][(dir+1)%8]==-2)
        {
            //v[x+dl[(dir+1)%8]][y+dc[(dir+1)%8]] = cnt+1;
            q[(cnt+1)%3].push({x+dl[(dir+1)%8], y+dc[(dir+1)%8], (dir+1)%8});
        }
        if(v[x+dl[(dir+2)%8]][y+dc[(dir+2)%8]][(dir+2)%8]==-2)
        {
            //v[x+dl[(dir+2)%8]][y+dc[(dir+2)%8]] = cnt+2;
            q[(cnt+2)%3].push({x+dl[(dir+2)%8], y+dc[(dir+2)%8], (dir+2)%8});
        }
        if(v[x+dl[(dir+7)%8]][y+dc[(dir+7)%8]][(dir+7)%8]==-2)
        {
            //v[x+dl[(dir+1)%8]][y+dc[(dir+1)%8]] = cnt+1;
            q[(cnt+1)%3].push({x+dl[(dir+7)%8], y+dc[(dir+7)%8], (dir+7)%8});
        }
        if(v[x+dl[(dir+6)%8]][y+dc[(dir+6)%8]][(dir+6)%8]==-2)
        {
            //v[x+dl[(dir+2)%8]][y+dc[(dir+2)%8]] = cnt+2;
            q[(cnt+2)%3].push({x+dl[(dir+6)%8], y+dc[(dir+6)%8], (dir+6)%8});
        }
    }
    int ok=0, mn=1000005;
    for(int i=0; i<8; i++)
    {
        if(v[a][b][i]>=0)
        {
            mn=min(mn, v[a][b][i]);
            ok=1;
        }
    }
    if(ok==0)
        cout<<-1;
    else
        cout<<mn;




    return 0;
}