#define __mode_debug__
/*   ξ
     ll
   ＿ll＿
 ／  ∞  ＼
│*  Ａ  *│
│*  Ｃ  *│
│*  祈  *│
│*  願  *│
│*      *│
 ￣￣￣￣￣    */
//C++14 (GCC 5.4.1)
#include <bits/stdc++.h>
using namespace std;
#ifdef __mode_debug__
    #define DBG
#else
    #define DBG if(false)
#endif

#define LLINF (1LL<<60)
using ll = long long;
#define mod  1000000007

#define whole(a) (a).begin(),(a).end()
#define rwhole(a) (a).rbegin(),(a).rend()

#define repd(i,a,b) for (ll i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define rrepd(i,a,b) for(ll i=(a);i>=(b);i--)
#define each(itr,ds) for(auto itr=(ds).begin();itr!=(ds).end();itr++)

template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); }

//DUMP
//  ostream vector<T> , vector<vector<T>> , set<T> ,queue<T> , priority_queue<T> , pair<T,U> , map<T,U>
template<class T> ostream& operator<<(ostream&os,vector<T>&vec){os<<"{ ";rep(i,vec.size()) os<<((i==0)?"":", ")<<i<<":"<<vec[i];os<<" }";return os;}
template<class T> ostream& operator<<(ostream&os,vector<vector<T>>&vec){os<<"{"<<endl;rep(i,vec.size())os<<"\t   "<<i<<":"<<vec[i]<<((i==vec.size()-1)? "":",")<<endl;os<<"\t }";return os;}
template<class T> ostream& operator<<(ostream&os,set<T>&p){os<<"{ ";each(itr,p)  os<<((itr==p.begin())?"":", ")<<*itr;os<<" }";return os;}
template<class T> ostream& operator<<(ostream&os,queue<T>&p){queue<T> q(p);os<<"[< "<<(q.empty()?" <]":"");while(!q.empty()){os<<q.front();q.pop();os<< (q.empty() ? " <]" : ", ");}return os;}
template<class T> ostream& operator<<(ostream&os,priority_queue<T>&p){priority_queue<T> q(p);os<<"[< "<<(q.empty()?" <]":"");while(!q.empty()){os<<q.top();q.pop();os<< (q.empty() ? " <]" : ", ");}return os;}
template<class T,class U> ostream& operator<<(ostream&os,pair<T,U>&p){os<<"("<<p.first<<","<<p.second<<")";return os;}
template<class T,class U> ostream& operator<<(ostream&os,map<T,U>&p){os<<"{ ";each(itr,p)os<<((itr==p.begin())?"":", ")<<itr->first<<":"<<itr->second;os<<" }";return os;}
void dump_f(string &nm,char t){cerr<<endl;}
template<class T,class... Ts> void dump_f(string &nm,char t,T &&x,Ts&&... ts){int l=nm.find_first_of(',');string name(nm,0,l),nx(nm,l+1,-1);if(t=='\n') cerr<<"  "<<name<<"\t: "<<x<<t;else cerr << name<<": "<<x<<","<<t;dump_f(nx,t,forward<Ts>(ts)...);}
template<class... Ts> void dump_m(int &&ln,string &&nm,char t,Ts&&... ts){cerr<<"[ln: "<<ln<<"]"<<t;dump_f(nm,t,forward<Ts>(ts)...);}
#define dump(...) DBG dump_m(__LINE__,#__VA_ARGS__,'\n',__VA_ARGS__)
#define dl(...) DBG dump_m(__LINE__,#__VA_ARGS__,'\t',__VA_ARGS__)

#define lower_bound_idx(V,c) distance(V.begin(),lower_bound(whole(V),c))

ll H,W,Ch,Cw,Dh,Dw;
vector<string> S(1000);
vector<vector<ll>> X(1000,vector<ll>(1000,LLINF));

priority_queue<pair<ll, pair<ll,ll>>, 
    vector<pair<ll, pair<ll,ll>>>, 
    greater<pair<ll, pair<ll,ll>>>> taskX,taskY,taskZ;

int hoko_x[4]={0,1,0,-1},
    hoko_y[4]={1,0,-1,0};


int main() {
    ios::sync_with_stdio(false);//printf<=>cout
    cin.tie(nullptr);//cin<=>cout


    cin >>H>>W;
    cin >>Ch>>Cw;
    cin >>Dh>>Dw;
    Ch--;Cw--;Dh--;Dw--;
    rep(i,H)cin>>S[i];
    //-----------------------------------

    taskX.push({0,{Ch,Cw}});
    rep(d,1000000){
        while(!taskX.empty() && taskX.top().first==d){
            ll sh = taskX.top().second.first, sw =taskX.top().second.second;
            taskX.pop();
            if(chmin(X[sh][sw],d)){
                taskY.push({d,{sh,sw}});
                rep(c,4){
                    if(0<=sh+hoko_y[c] && sh+hoko_y[c]<H && 0<=sw+hoko_x[c] && sw+hoko_x[c]<W
                        && S[sh+hoko_y[c]][sw+hoko_x[c]]=='.')
                    taskX.push({d,{sh+hoko_y[c],sw+hoko_x[c]}});
                }
            }
        }
        while(!taskY.empty() && taskY.top().first==d){
            ll sh = taskY.top().second.first, sw =taskY.top().second.second;
            taskY.pop();
            repd(i,-2,3) repd(j,-2,3){
                if(0<=sh+i && sh+i<H && 0<=sw+j && sw+j<W
                    && S[sh+i][sw+j]=='.' && X[sh+i][sw+j]>d+1)
                    taskX.push({d+1,{sh+i,sw+j}});
            }
        }
        if(taskX.empty()&& taskY.empty()) break;
    }

    cout << ((X[Dh][Dw]==LLINF) ? -1 : X[Dh][Dw]) <<'\n';


    return (0);
}

Measured memory_bytes: 12840