#ifdef LOCAL
//#define _GLIBCXX_DEBUG
#endif
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
typedef vector<vector<vector<ll>>> VVV;
typedef vector<vector<vector<vector<ll>>>> VVVV;

#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF=1e18+18;
const ll MOD=1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a,b)
#define Each(a,b) for(auto &a :b)
#define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i)
#ifdef LOCAL
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp) cerr << #mp << ":"<<endl; for (auto i = mp.begin(); i != mp.end(); ++i) { cerr << i->first <<":"<<i->second << endl;}
#define dbgarr(n,m,arr) rep(i,n){rep(j,m){cerr<<arr[i][j]<<" ";}cerr<<endl;}
#define dbgdp(n,arr) rep(i,n){cerr<<arr[i]<<" ";}cerr<<endl;
#define dbgmint(n,arr) rep(i,n){cerr<<arr[i].x<<" ";}cerr<<endl;
#define dbgarrmint(n,m,arr) rep(i,n){rep(j,m){cerr<<arr[i][j].x<<" ";}cerr<<endl;}
#else
#define dbg(...)
#define dbgmap(...)
#define dbgarr(...)
#define dbgdp(...)
#define dbgmint(...)
#define dbgarrmint(...)
#endif
#define out(a) cout<<a<<endl
#define out2(a,b) cout<<a<<" "<<b<<endl
#define vout(v) rep(i,v.size()){cout<<v[i]<<" ";}cout<<endl
#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define fi first
#define se second

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }

template<typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) { return s<<"("<<p.first<<", "<<p.second<<")"; }

template<typename T>istream& operator>>(istream&i,vector<T>&v)
{rep(j,v.size())i>>v[j];return i;}

// vector
template<typename T>
ostream &operator<<(ostream &s, const vector<T> &v) {
    int len=v.size();
    for(int i=0; i<len; ++i) {
        s<<v[i];
        if(i<len-1) s<<" ";
    }
    return s;
}

// 2 dimentional vector
template<typename T>
ostream &operator<<(ostream &s, const vector<vector<T> > &vv) {
    int len=vv.size();
    for(int i=0; i<len; ++i) {
        s<<vv[i]<<endl;
    }
    return s;
}

//mint
struct mint {
    ll x; // typedef long long ll;
    mint(ll x=0):x((x%MOD+MOD)%MOD){}
    mint operator-() const { return mint(-x);}
    mint& operator+=(const mint a) {
        if ((x += a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator-=(const mint a) {
        if ((x += MOD-a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator*=(const mint a) { (x *= a.x) %= MOD; return *this;}
    mint operator+(const mint a) const { return mint(*this) += a;}
    mint operator-(const mint a) const { return mint(*this) -= a;}
    mint operator*(const mint a) const { return mint(*this) *= a;}
    mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
    }

    // for prime MOD
    mint inv() const { return pow(MOD-2);}
    mint& operator/=(const mint a) { return *this *= a.inv();}
    mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
typedef vector<mint> Vmint;

struct combination {
    vector<mint> fact, ifact;
    combination(int n):fact(n+1),ifact(n+1) {
        assert(n < MOD);
        fact[0] = 1;
        for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
        ifact[n] = fact[n].inv();
        for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
    }
    mint operator()(int n, int k) {
        if (k < 0 || k > n) return 0;
        return fact[n]*ifact[k]*ifact[n-k];
    }
};

//dijkstra
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout<<std::setprecision(10);

    ll H,W,ch,cw,dh,dw;
    cin>>H>>W>>ch>>cw>>dh>>dw;
    ch--;
    dh--;
    cw--;
    dw--;

    pair<ll,ll> start = mp(ch,cw);
    pair<ll,ll> goal = mp(dh,dw);
//    Vs c(H);
//    cin>>c;

    vector<vector<char>> s(H, vector<char>(W));
    ll ans=0;

    for (ll i = 0; i < H; i++) {
        for (ll j = 0; j < W; j++) {
            char ch;
            cin>>ch;
            s[i][j]=ch;
        }
    }

//    dbg(s);

    auto comp = [](pair<P,ll> a, pair<P,ll> b){
        return a.se > b.se;
    };

    priority_queue<pair<P,ll>,vector<pair<P,ll>>,decltype(comp)> q(comp);

    q.push(mp(start,0));
    vector<vector<ll>> dist(H,vector<ll>(W,INF));
    dist[start.fi][start.se] = 0;

    auto in = [&](P p){
        return p.fi>=0 && p.fi<H && p.se>=0 && p.se <W;
    };

    vector<ll> dx{-1,0,1,0};
    vector<ll> dy{0,1,0,-1};

    vector<ll> bdx{-2,-1,0,1,2,
                   -2,-1,  1,2,
                   -2,       2,
                   -2,-1,  1,2,
                   -2,-1,0,1,2};
    vector<ll> bdy{-2,-2,-2,-2,-2,
                   -1,-1,   -1,-1,
                    0,          0,
                    1, 1,    1, 1,
                    2, 2, 2, 2, 2};

    while (!q.empty()) {
        pair<ll,ll> now = q.top().fi;
        ll nowscore = q.top().se;
        q.pop();
//        dbg(mp(now,nowscore));

        ll ng = 0;
        for (ll i = 0; i < 4; i++) {
            ll ny = now.fi + dy[i];
            ll nx = now.se + dx[i];
            ll ns = nowscore;

            if(!in(mp(ny,nx))) {
//                ng++;
                continue;
            }

            if(s[ny][nx] == '#'){
//                ng++;
//                ns++;
                continue;
            }
            if(dist[ny][nx] > ns){
//                if(now.fi==3 && now.se==2){
//                    dbg(mp(ny,nx))
//                }
                dist[ny][nx] = ns;
                q.push(mp(mp(ny,nx),ns));
            }
        }
//        if(now.fi==3 && now.se==2){
//            dbg(ng)
//        }
        //移動B
//        if(ng >= 4) {
            for (ll i = 0; i < 20; i++) {
                ll ny = now.fi + bdy[i];
                ll nx = now.se + bdx[i];
                ll ns = nowscore + 1;

                if(!in(mp(ny,nx))) {
                    ng++;
                    continue;
                }

                if(s[ny][nx] == '#'){
//                    ng++;
//                    ns++;
                    continue;
                }
                if(dist[ny][nx] > ns){
                    dist[ny][nx] = ns;
                    q.push(mp(mp(ny,nx),ns));
                }
            }
//            if(ng >= 24) {
//                cout<<-1<<endl;
//                return 0;
//            }
//        }

//        dbg(dist);
    }

    if(dist[goal.fi][goal.se] == INF) {
         cout<<-1<<endl;
         return 0;
    }

    cout<<dist[goal.fi][goal.se]<<endl;
    return  0;
}

Measured memory_bytes: 12484