#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define mod 1000000007

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

ll binpow(ll x,ll y)/* (x^y)%p in O(log y) */{ll res=1;while (y > 0){if(y&1)res=(res*x);y = y>>1;x=(x*x);}return res;}
ll binpowmod(ll x,ll y,ll p)/* (x^y)%p in O(log y) */{ll res=1;x=x%p;while (y > 0){if(y&1)res=(res*x)%p;y = y>>1;x=(x*x)%p;}return res;}
ll mod_inverse(ll n,ll p)/* Returns n^(-1) mod p */{return binpowmod(n,p-2,p);}
ll gcd(ll x,ll y)
{
    if(y==0)
        return x;
    return gcd(y,x%y);
}
bool comp_pairs_by_s(pair<ll,ll> &x ,pair<ll,ll> &y)
{
    return x.second<y.second;
}
bool isPowerOfTwo (ll x)  
{  
    /* First x in the below expression is for the case when x is 0 */
    return x && (!(x&(x-1)));  
}

class cmp      //comparator for priority_queue 
{               //declaration: priority_queue<int,vector<int>,cmp>
public:         
    bool operator()(pair<int,int> A,pair<int,int> B)
    {
        if(abs(A.first-A.second)==abs(B.first-B.second))
            return A.first>B.first;
        return abs(A.first-A.second)<abs(B.first-B.second);
    }
};
// int prime[10000007]={0};
// void sieve(void)
// {
//  int i,j;
//  for(i=0;i<10000007;i++)
//         prime[i]=1;
//  prime[0]=0,prime[1]=0;
//  for(i=2;i<=sqrt(10000007);i++){
//      if(prime[i]==i){
//          for(j=i*i;j<10000007;j+=i){
//             if(!prime[j])
//                 prime[j]=0;
//          }
//      }
//  }
    
// }
void swap(ll &x,ll &y){
    int temp=x;
    x=y;
    y=temp;
}
  
unsigned int onesComplement(unsigned int n) 
{ 
   // Find number of bits in the given integer 
   int number_of_bits = floor(log2(n))+1; 
  
   // XOR the given integer with poe(2,  
   // number_of_bits-1 and print the result  
   return ((1 << number_of_bits) - 1) ^ n; 
}
bool comp(pair<ll,ll> x,pair<ll,ll> y)
{
    return x.second<y.second;
}

bool comp1(pair<ll,ll> x,pair<ll,ll> y)
{
    return x.second<y.second;
}
bool isvalid(int x,int y,int h,int w){
    if(x<0 || x>=h ||y<0 || y>=w)
        return false;
    return true;
}
void solve()
{   
    int h,w;
    cin>>h>>w;
    int ch,cw,dh,dw;
    cin>>ch>>cw>>dh>>dw;
    ch--; cw--; dh--; dw--;
    vector<vector<char>> mat(h,vector<char>(w));
    for(int i=0;i<h;++i)
        for(int j=0;j<w;++j)
            cin>>mat[i][j];
    vector<vector<int>> cost(h,vector<int>(w,INT_MAX));
    vector<vector<bool>> vis(h,vector<bool>(w,0));
    deque<pair<int,int>> q;
    q.push_front({ch,cw});
    cost[ch][cw]=0;
    vis[ch][cw]=1;
    int dx[4]={1,-1,0,0};
    int dy[4]={0,0,1,-1};
    while(!q.empty()){
        auto node=q.front();
        q.pop_front();
        int x=node.first;
        int y=node.second;
        for(int i=0;i<4;++i){
            int newx=x+dx[i];
            int newy=y+dy[i];
            if(isvalid(newx,newy,h,w) && mat[newx][newy]!='#'){
                if(cost[newx][newy]>cost[x][y]){
                    cost[newx][newy]=cost[x][y];
                    q.push_front({newx,newy});
                }
            }
            
        }
        for(int i:{0,1,-1,2,-2})
            for(int j:{0,1,-1,2,-2}){
                int newx=x+i;
                int newy=y+j;
                if(newy==y && newx==x) continue;
                if(isvalid(newx,newy,h,w) && mat[newx][newy]!='#'){
                    if(cost[newx][newy]>cost[x][y]+1){
                        cost[newx][newy]=min(cost[newx][newy],cost[x][y]+1);
                        q.push_back({newx,newy});
                    }
                }
            }
    }
    if(cost[dh][dw]==INT_MAX)
        cout<<-1;
    else
        cout<<cost[dh][dw];

}   
    
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); 
    solve();
}   



Measured memory_bytes: 8832