#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;

using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
const ll mod = 1000000007ll;
//const ll mod = 10007;

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;}




#define rep(i, n)         for(ll i = 0; i < (ll)(n); i++)
#define brep(n)           for(int bit=0;bit<(1<<n);bit++)
#define bbrep(n)           for(int bbit=0;bbit<(1<<n);bbit++)
#define erep(i,container) for (auto &i : container)
#define itrep(i,container) for (auto i : container)
#define irep(i, n)        for(ll i = n-1; i >= (ll)0ll; i--)
#define rrep(i,m,n) for(ll i = m; i < (ll)(n); i++)
#define reprep(i,j,h,w) rep(i,h)rep(j,w)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define VEC(type,name,n) std::vector<type> name(n);rep(i,n)std::cin >> name[i];
#define pb push_back
#define pf push_front
#define query int qq;std::cin >> qq;rep(qqq,qq)
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define itn int
#define mp make_pair
#define sum(a) accumulate(all(a),0ll)
#define keta fixed<<setprecision
#define vout(a) erep(qxqxqx,a)std::cout << qxqxqx << ' ';std::cout  << std::endl;
#define vvector(name,typ,m,n,a)vector<vector<typ> > name(m,vector<typ> (n,a))
//#define vvector(name,typ,m,n)vector<vector<typ> > name(m,vector<typ> (n))
#define vvvector(name,t,l,m,n,a) vector<vector<vector<t> > > name(l, vector<vector<t> >(m, vector<t>(n,a)));
#define vvvvector(name,t,k,l,m,n,a) vector<vector<vector<vector<t> > > > name(k,vector<vector<vector<t> > >(l, vector<vector<t> >(m, vector<t>(n,a)) ));
#define case std::cout <<"Case #" <<qqq+1<<":"
#define RES(a,i,j) a.resize(i);rep(ii,i)a[ii].resize(j);
#define res resize
#define as assign
#define ffor for(;;)
#define ppri(a,b) std::cout << a<<" "<<b << std::endl
#define pppri(a,b,c) std::cout << a<<" "<<b <<" "<< c<<std::endl
#define aall(x,n) (x).begin(),(x).begin()+(n)
#define ssum(a) accumulate(a,0ll) 
#define stirng string
#define gin(a,b) int a,b;std::cin >> a>>b;a--;b--;
//#define grid_input(a,type) int h,w;std::cin >> h>>w;vvector(a,type,h,w,0);reprep(i,j,h,w)std::cin >> a[i][j];

//typedef long long T;
ll ceil(ll a,ll b){
    return ((a+b-1)/b);
}
const int INF = 2000000000;
//const ll INF64 =3223372036854775807ll;
//const ll INF64 = 9223372036854775807ll;
const ll INF64 = 9223372036854775ll;
const ll MOD = 1000000007ll;
//const ll MOD = 1000003ll;
const ll OD = 1000000000000007ll;
const dou pi=3.141592653589793;


//メモ
//tuple<hoge,huga,foo> tのget関数はget<i>(t)
//resizeはメンバ関数
//三項演算子を覚えよう

int h,w;
int sss,ss;
int ggg,gg;
std::vector<int> dd{-1,0,1,0,-1};
bool hani(int i,int j){//grid上探索において範囲内かどうかをreturn
    if(i>=0&&i<h&&j>=0&&j<w)return true;
    else return false;
}

int main(){
    std::cin >> h>>w;
    std::cin >> sss>>ss;
    std::cin >> ggg>>gg;
    vvector(aa,char,h,w,0);
    reprep(i,j,h,w)std::cin >> aa[i][j];
    
    int n=0;
    std::vector<std::vector<char>> a(aa);
    vvector(c,int,h,w,-1);
    reprep(ii,jj,h,w){
        if(a[ii][jj]=='.'){
            queue<P>q;
            q.push(mp(ii,jj));
            a[ii][jj]='#';
            c[ii][jj]=n;
            while(!q.empty()){
                int y=q.front().fi;
                int x=q.front().se;
                rep(i,4){
                    int yy=y+dd[i];
                    int xx=x+dd[i+1];
                    if(hani(yy,xx)&&a[yy][xx]=='.'){
                        a[yy][xx]='#';
                        c[yy][xx]=n;
                        q.push(mp(yy,xx));
                    }
                }
                q.pop();
            }
            n++;
        }
    }
    //   std::cout << 123 << std::endl;
    /*
    rep(i,h){
        vout(c[i]);
    }
    */
    std::vector<set<int>> g(n);
    //std::cout << 123 << std::endl;
    reprep(ii,jj,h,w){
        rrep(i,-2,3){
            rrep(j,-2,3){
                if(c[ii][jj]==-1||!hani(i+ii,j+jj))continue;
             //  std::cout << c[ii][jj] << std::endl;
                if(c[i+ii][j+jj]!=-1&&c[i+ii][j+jj]!=c[ii][jj]){
             //       std::cout << c[ii][jj] << std::endl;
                    g[c[ii][jj]].insert(c[i+ii][j+jj]);
                }
            }
            
        }
    }
    int st,go;  
    sss--;ss--;
    ggg--;gg--;
    st=c[sss][ss];
    go=c[ggg][gg];
    if(st==go){
        std::cout << 0 << std::endl;
        exit(0);
    }
    std::vector<int> d(n,-1);
    d[st]=0;
    std::queue<int> q;
    q.push(st);
    while(!q.empty()){
        int p=q.front();
        erep(i,g[p]){
            if(d[i]==-1){
                q.push(i);
                d[i]=d[p]+1;
            }
        }
        q.pop();
    }
    std::cout << d[go] << std::endl;
}


Measured memory_bytes: 33884