#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
#define Pool(i, m, n) for (ll i = n; i >= m; i--)
#define mod 1000000007ll
//#define mod 998244353ll
#define flagcount __builtin_popcount
#define flag(x) (1ll << x)
#define flagadd(bit, x) bit |= flag(x)
#define flagpop(bit, x) bit &= ~flag(x)
#define flagon(bit, i) bit &flag(i)
#define flagoff(bit, i) !(bit & (1ll << i))
#define all(v) v.begin(), v.end()
#define low2way(v, x) lower_bound(all(v), x)
#define high2way(v, x) upper_bound(all(v), x)
#define idx_lower(v, x) (distance(v.begin(), low2way(v, x)))  //配列vでx未満の要素数を返す
#define idx_upper(v, x) (distance(v.begin(), high2way(v, x))) //配列vでx以下の要素数を返す
#define idx_lower2(v, x) (v.size() - idx_lower(v, x))         //配列vでx以上の要素数を返す
#define idx_upper2(v, x) (v.size() - idx_upper(v, x))         //配列vでxより大きい要素の数を返す
#define putout(a) cout << a << endl
#define Sum(v) accumulate(all(v), 0ll)
#define gcd(x, y) __gcd(x, y)
ll ctoi(char c)
{
    if (c >= '0' && c <= '9')
    {
        return c - '0';
    }
    return -1;
}
template <typename T>
T lcm(T x, T y)
{
    T z = gcd(x, y);
    return x * y / z;
}
template <typename T>
bool primejudge(T n)
{
    if (n < 2)
        return false;
    else if (n == 2)
        return true;
    else if (n % 2 == 0)
        return false;
    double sqrtn = sqrt(n);
    for (T i = 3; i < sqrtn + 1; i++)
    {
        if (n % i == 0)
        {
            return false;
        }
        i++;
    }
    return true;
}
template <typename T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b; // aをbで更新
        return true;
    }
    return false;
}
template <typename T>
bool chmin(T &a, const T &b)
{
    if (a > b)
    {
        a = b; // aをbで更新
        return true;
    }
    return false;
}
//場合によって使い分ける
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
//const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
//const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
//2次元配列の宣言
//vector<vector<ll>> field(h, vector<ll>(w));
struct edge
{
    long long to;
    long long cost;
};
typedef pair<long long, long long> P; //P.first:最短距離,P.second:頂点の番号
//頂点V個の負閉路なし重み付きグラフGにおける始点sからの最短距離を求める
long long V;
vector<vector<edge>> G;
void dijkstra(vector<long long> &dist, long long s)
{
    //greater<P>によってfirstが小さい順に取り出される
    priority_queue<P, vector<P>, greater<P>> que;
    for (long long i = 0; i < V; i++)
        dist[i] = 1e18;
    dist[s] = 0;
    que.push(P(0, s));
    //queが空になるまで繰り返す
    while (!que.empty())
    {
        P p = que.top();
        que.pop();
        long long v = p.second;
        if (dist[v] < p.first)
            continue; //すでに最短距離ならスルー
        for (long long i = 0; i < G[v].size(); i++)
        {
            edge e = G[v][i];
            //更新作業
            if (dist[e.to] <= dist[v] + e.cost)
                continue;
            dist[e.to] = dist[v] + e.cost;
            que.push(P(dist[e.to], e.to));
        }
    }
}
int main()
{
    cout << fixed << setprecision(30);
    ll H, W, sh, sw, gh, gw;
    cin >> H >> W >> sh >> sw >> gh >> gw;
    sh--;
    sw--;
    gh--;
    gw--;
    vector<string> field(H);
    loop(i, H) cin >> field[i];
    V = H * W;
    G.resize(V);
    loop(i, H)
    {
        loop(j, W)
        {
            ll now = i * W + j;
            //コスト0の辺
            loop(d, 4)
            {
                ll ni = i + dx[d], nj = j + dy[d];
                ll next = ni * W + nj;
                if (ni < 0 || ni >= H || nj < 0 || nj >= W)
                    continue;
                if (field[ni][nj] == '#')
                    continue;
                edge e;
                e.to = next;
                e.cost = 0;
                G[now].push_back(e);
            }
            //コスト1の辺
            for (ll d1 = -2; d1 <= 2; d1++)
            {
                for (ll d2 = -2; d2 <= 2; d2++)
                {
                    ll ni = i + d1, nj = j + d2;
                    ll next = ni * W + nj;
                    if (ni < 0 || ni >= H || nj < 0 || nj >= W)
                        continue;
                    if (field[ni][nj] == '#')
                        continue;
                    edge e;
                    e.to = next;
                    e.cost = 1;
                    G[now].push_back(e);
                }
            }
        }
    }
    vector<ll> dist(V);
    ll start = sh * W + sw, goal = gh * W + gw;
    dijkstra(dist, start);
    if (dist[goal] == 1e18)
        putout(-1);
    else
        putout(dist[goal]);
    return 0;
}


Measured memory_bytes: 362620