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

const int N = 1e3 + 5;

int n,m;

int sx,sy,tx,ty;

int head[N * N], ver[(N * N) << 1], nxt[(N * N) << 1], edge[(N * N) << 1], tot;

char a[N][N];

void add(int x,int y,int z){
    ver[++tot] = y, edge[tot] = z, nxt[tot] = head[x], head[x] = tot;
}

int Next[N][N][4];

// shang: 0, xia: 1, zuo: 2, you: 3

int F(int x,int y){
    return (x - 1) * m + y;
}

int d[N * N];

bool v[N * N];

void bfs(){
    memset(d,0x3f,sizeof(d));
    priority_queue<pair<int,int>> q;
    q.push({0,F(sx,sy)});
    d[F(sx,sy)] = 0;
    while (q.size()){
        int x = q.top().second; q.pop();
        // cout << x << ' ' << d[x] << '\n';
        if (v[x]) continue;
        v[x] = 1;
        for (int i = head[x];i;i = nxt[i]){
            int y = ver[i], z = edge[i];
            // cout << "edge:" <<  x << ' ' << y << ' ' << z << '\n';
            if (d[y] > d[x] + z){
                d[y] = d[x] + z;
                q.push({-d[y],y});
                // if (z == 1)
                //     q.push_front(y);
                // else
                //     q.push_back(y);
            }
        }
    }
}

int main(){
    scanf("%d%d",&n,&m);
    for (int i = 1;i <= n;i++)
        scanf("%s", a[i] + 1);
    scanf("%d%d%d%d",&sx,&sy,&tx,&ty);
    for (int j = 1;j <= m;j++){
        int pre = -1;
        for (int i = 1;i <= n;i++){
            if (a[i][j] == '.'){
                Next[i][j][0] = pre;
                if (pre == -1)
                    pre = F(i,j);
            }
            else
                pre = -1;
        }
    }
    for (int j = 1;j <= m;j++){
        int pre = -1;
        for (int i = n;i >= 1;i--){
            if (a[i][j] == '.'){
                Next[i][j][1] = pre;
                if (pre == -1)
                    pre = F(i,j);
            }
            else
                pre = -1;
        }
    }
    for (int i = 1;i <= n;i++){
        int pre = -1;
        for (int j = 1;j <= m;j++){
            if (a[i][j] == '.'){
                Next[i][j][2] = pre;
                if (pre == -1)
                    pre = F(i,j);
            }
            else
                pre = -1;
        }
    }
    for (int i = 1;i <= n;i++){
        int pre = -1;
        for (int j = m;j >= 1;j--){
            if (a[i][j] == '.'){
                Next[i][j][3] = pre;
                if (pre == -1)
                    pre = F(i,j);
            }
            else
                pre = -1;
        }
    }
    // for (int i = 1;i <= n;i++){
    //     for (int j = 1;j <= m;j++){
    //         cout << i << ' ' << j << ' ' << Next[i][j][3] << '\n';
    //     }
    // }
    // return 0;
    for (int i = 1;i <= n;i++){
        for (int j = 1;j <= m;j++){
            if (a[i][j] == '.'){
                if (a[i + 1][j] == '.' && F(i + 1,j) != Next[i][j][1])
                    add(F(i,j),F(i + 1,j),2);
                if (a[i][j + 1] == '.' && F(i,j + 1) != Next[i][j][3])
                    add(F(i,j),F(i,j + 1),2);
                if (a[i - 1][j] == '.' && F(i - 1,j) != Next[i][j][0])
                    add(F(i,j),F(i - 1,j),2);
                if (a[i][j - 1] == '.' && F(i,j - 1) != Next[i][j][2])
                    add(F(i,j),F(i,j - 1),2);
            }
        }
    }
    for (int i = 1;i <= n;i++)
        for (int j = 1;j <= m;j++)
            for (int k = 0;k < 4;k++)
                if (Next[i][j][k] != -1 && a[i][j] == '.')
                    add(F(i,j),Next[i][j][k],1)/*, cout << k << ' ' << F(i,j) << ' ' << Next[i][j][k] << '\n'*/;
    // return 0;
    bfs();
    if (!v[F(tx,ty)]) d[F(tx,ty)] = -1;
    printf("%d",d[F(tx,ty)]);
    return 0;
}