#include <bits/stdc++.h>

using namespace std;

const int kDir = 8;
const int kCost = 4;
const int kMaxN = 505;
const int kInf = 0x3f3f3f3f;
const int dx[kDir] = {-1, -1, -1, 0, 1, 1, 1, 0};
const int dy[kDir] = {-1, 0, 1, 1, 1, 0, -1, -1};

int n, m;
int v[kMaxN][kMaxN];
int d[kMaxN][kMaxN][kDir];
vector <pair <pair <int, int>, int>> buckets[kMaxN * kMaxN * kCost];

int shortestPath(const int xS, const int yS, const int xE, const int yE) {
    for (int i = 0; i < kMaxN; i++) {
        for (int j = 0; j < kMaxN; j++) {
            for (int k = 0; k < kDir; k++) {
                d[i][j][k] = kInf;
            }
        }
    }
    for (int i = 0; i < kDir; i++) {
        d[xS][yS][i] = 0;
        buckets[0].push_back({{xS, yS}, i});
    }
    for (int i = 0; i <= n * m * 4; i++) {
        while (!buckets[i].empty()) {
            const int x = buckets[i].back().first.first;
            const int y = buckets[i].back().first.second;
            const int dir = buckets[i].back().second;
            buckets[i].pop_back();
            if (d[x][y][dir] == i) { 
                for (int j = 0; j < kDir; j++) {
                    const int nx = x + dx[j];
                    const int ny = y + dy[j];
                    const int ndir = j;
                    const int cst = (j < dir ? (min(dir - j, j + kDir - dir)) : (min(j - dir, dir + kDir - j)));
                    if (v[nx][ny] == 0 && 1 <= nx && nx <= n && 1 <= ny && ny <= m && d[nx][ny][ndir] > i + cst) {
                        d[nx][ny][ndir] = i + cst;
                        buckets[i + cst].push_back({{nx, ny}, ndir});
                    }
                }
            }
        }
    }
    int dmin = kInf;
    for (int i = 0; i < kDir; i++) {
        dmin = min(dmin, d[xE][yE][i]);
    }
    return (dmin == kInf ? -1 : dmin);
}

int main() {
    freopen("car.in", "r", stdin);
    freopen("car.out", "w", stdout);
    
    int xS, yS, xE, yE;
    scanf("%d %d", &n, &m);
    scanf("%d %d %d %d", &xS, &yS, &xE, &yE);
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            scanf("%d", &v[i][j]);
        }
    }
    printf("%d\n", shortestPath(xS, yS, xE, yE));
    return 0;
}