#include<stdio.h>
struct note{
    int x;    //x坐标 
    int y;    //y坐标 
    int f;    //队列标号 
    int s;    //步数 
};
int main()
{
    struct note que[2501];     //地图大小不会超过50*50
    int book[51][510]={0};    //记录步数，防止一个点被重复走 
    int a[51][51]={0};        //用来存储步数
    
    //定义一个走的数组 
    int next[4][2]={
        {0,1},//右走
        {1,0},//左走 
        {0,-1},//上走 
        {-1,0}, //下走 
    }; 
    
    int startx,starty,q,p,i,j,k,head,tail,tx,ty; //起点坐标 终点横纵坐标 
    int n,m;    //迷宫的纵横数 
    int flag; 
    
    scanf("%d %d",&n,&m); 
    //输入棋谱 
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            scanf("%d",&a[i][j]);
        }
        
     } 
     
     //输入起始坐标和终点坐标
     scanf("%d %d %d %d",&startx,&starty,&p,&q);
     
     //队列的初始化 
     head = 1;
     tail = 1;
     
     //往队列中插入入口坐标
     que[tail].x = startx;
     que[tail].y = starty;
     que[tail].s = 0;
     que[tail].f = 0;
     tail++;
     book[startx][starty] = 1;
     
     flag = 0;
     while(head<tail){
         for(k=0;k<=3;k++)
         {
             //枚举四个方向 
             tx = que[head].x + next[k][0];
             ty = que[head].y + next[k][1];
             
             if(tx<1 || ty<1 || tx>n || ty>m)
                 continue;
                 
             if(a[tx][ty] == 0&& book[tx][ty] == 0)
             {
                 book[tx][ty] = 1;    //标记为已走过
                que[tail].x = tx;
                que[tail].y = ty;
                que[tail].s = que[head].s + 1;
                tail++;     
             }
             
            if(tx == p && ty == q)
            {
                flag = 1;
                break;
            }
         }
        if(flag == 1)
            break; 
         head++;
     } 
     
    printf("%d",que[tail-1].s);
    getchar();getchar();
    return 0;
 }