#include <bits/stdc++.h>

using namespace std;

ifstream f("car.in");
ofstream g("car.out");

int n,m,as,bs,af,bf;
int dp[505][505][8],fost[505][505][8],dx[8]= {-1,-1,0,1,1,1,0,-1},dy[8]= {0,1,1,1,0,-1,-1,-1};
bool acces[505][505];
struct stare
{
    int cost,x,y,sens;
};
deque<stare>coada;

bool valid(int x,int y)
{
    if(x<1||y<1||x>n||y>m||acces[x][y]) return 0;
    return 1;
}

void solve()
{
    for(int i=0; i<8; i++)
    {
        coada.push_front({0,as,bs,i});
        dp[as][bs][i]=0;
    }

    bool OK=0;
    while(!coada.empty())
    {
        int cost=coada.front().cost;
        int x=coada.front().x;
        int y=coada.front().y;
        int sens=coada.front().sens;
        coada.pop_front();

        if(fost[x][y][sens]==1) continue;
        fost[x][y][sens]=1;

        int sensnou=sens;
        int ni=x+dx[sensnou];
        int nj=y+dy[sensnou];

        if(valid(ni,nj))
        {
            if(cost<dp[ni][nj][sens])
            {
                dp[ni][nj][sens]=cost;
                coada.push_front({cost,ni,nj,sens});
            }
        }
        sensnou=(sens+1)%8;
        if(cost+1<dp[x][y][sensnou])
        {
            dp[x][y][sensnou]=cost+1;
            coada.push_back({cost+1,x,y,sensnou});
        }
        sensnou=(sens-1+8)%8;
        if(cost+1<dp[x][y][sensnou])
        {
            dp[x][y][sensnou]=cost+1;
            coada.push_back({cost+1,x,y,sensnou});
        }
    }

    int ans=1e9;
    for(int i=0;i<8;i++){
        ans=min(ans,dp[af][bf][i]);
    }

    if(ans==1e9) g<<-1;
    else g<<ans;
}

int main()
{
    f>>n>>m>>as>>bs>>af>>bf;

    for(int i=1; i<=n; i++)
        for(int j=1; j<=m; j++)
        {
            f>>acces[i][j];
            for(int z=0; z<8; z++) dp[i][j][z]=1e9;
        }
    solve();

    return 0;
}