//Generated at 2020-08-22 20:38:35 UTC+8
//Created by Alphagocc
#include<bits/stdc++.h>
#ifdef USE_PBDS
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/priority_queue.hpp>
#endif
using namespace std;
#define FI __inline__ __attribute__((always_inline))
#define TN typename
#define TP template
#define TS *this
class IO{static const int bufSize=1<<18;char inBuf[bufSize],outBuf[bufSize];char*ip1=inBuf,*ip2=inBuf;int ok=1,op1=-1,op2=bufSize-1;
TP <TN T>FI void __RI(T&x){int ch=gc(),neg=1;x=0;for(;!(ch==EOF||isdigit(ch)||ch=='-');ch=gc());if(ch==EOF){ok=0;return;}if(ch=='-')neg=-1,ch=gc();for(;isdigit(ch);ch=gc())x=x*10+(ch-48)*neg;}
TP <TN T>FI void __RC(T&x){unsigned char ch;while(isspace(ch=gc()));if(ch==EOF){ok=0;return;}x=ch;}FI void __RS(string&x){char ch;x.clear();for(ch=gc();isspace(ch);ch=gc());if(ch==EOF){ok=0;return;}for(;!isspace(ch);ch=gc())x.push_back(ch);}
public:
FI int gc(){return ip1==ip2 &&(ip2 =(ip1=inBuf)+fread(inBuf,1,bufSize,stdin),ip1==ip2)?EOF:*ip1++;}
FI IO&R(char&x){__RC(x);return TS;}FI IO& R(unsigned char&x){__RC(x);return TS;}FI IO&R(string&x){__RS(x);return TS;}TP<TN T1,TN T2>FI IO&R(pair<T1,T2>&x){R(x.first),R(x.second);return TS;}TP<TN T>FI IO&R(vector<T>&x){for(auto &i:x)R(i);return TS;}
TP <TN T,TN...Args>FI IO&RA(T*a,int n){for(int i=0;i<n;++i)R(a[i]);return TS;}TP<TN T,TN...Args>FI IO&R(T&x,Args&...args){R(x),R(args...);return TS;}
TP <TN T,TN...Args>FI IO&RA(T*a,int n,Args...args){for(int i=0;i<n;++i)RA(a[i],args...);return TS;}TP<TN T>FI IO&R(T&x){static_assert(is_integral<T>::value,"Unsupported types");if(is_integral<T>::value)__RI(x);return TS;}
private:
char space=' ';TP<TN T>FI void __WI(T x){static char buf[64];static int len=-1;if(x>=0){do{buf[++len]=x%10+48,x/=10;}while(x);}else{pc('-');do{buf[++len]=-(x%10)+48,x/=10;}while(x);}while(len>=0){pc(buf[len]),--len;}}
public:
FI void pc(const char&x){if(op1==op2)flush();outBuf[++op1]=x;}
FI void flush(){fwrite(outBuf,1,op1+1,stdout),op1=-1;}FI IO&W(const char&x){pc(x);return TS;}FI IO&W(const char*x){while(*x!='\0')pc(*(x++));return TS;}FI IO&W(const string&x){W(x.c_str());return TS;}
TP<TN T>FI IO& W(const vector<T>&x){for(auto&i:x)WS(i);WL();return TS;}FI IO&WL(){W('\n');return TS;}TP<TN T1,TN T2>FI IO& W(const pair<T1,T2>&x){WS(x.first),W(x.second);return TS;}
TP<TN T>FI IO& WL(const T&x){W(x),W('\n');return TS;}FI IO&WS(){W(' ');return TS;}TP<TN T>FI IO& WS(const T&x){W(x),W(space);return TS;}
TP<TN T>FI IO& WA(T* a,int n){for(int i=0;i<n;i++)WS(a[i]);WL();return TS;}TP<TN T,TN...Args>FI IO& W(const T&x,const Args&...args){W(x),W(space),W(args...);return TS;}
TP<TN...Args>FI IO& WL(const Args&...args){W(args...),W('\n');return TS;}TP<TN T,TN...Args>FI IO& WA(T* a,int n,Args...args){for(int i=0;i<n;i++)WA(a[i],args...);return TS;}
TP<TN T>FI IO& W(const T&x){static_assert(is_integral<T>::value,"Unsupported types");if(is_integral<T>::value)__WI(x);return TS;}
TP<TN T>FI IO&operator>>(T&x){R(x);return TS;}TP<TN T>FI IO&operator<<(const T&x){W(x);return TS;}bool good(){return ok;}IO(){}~IO(){flush();}}io;
#undef TN 
#undef TP
#undef FI
#undef TS
#define REP(i,x,y)for(int i=x;i<y;i++)
#define ALL(x)x.begin(),x.end()
const int32_t INF=0x3f3f3f3f;
const int64_t INFL=0x3f3f3f3f3f3f3f3fLL;

vector<vector<char>> G;
struct Node
{
    int x, y;
    int magic, step;
    Node(int magic, int step, int x, int y)
        : x(x)
        , y(y)
        , magic(magic)
        , step(step)
    {}
    bool operator<(const Node &other) const
    {
        return magic != other.magic ? magic > other.magic : step > other.step;
    }
};
const int dir[4][2] = { { 0, 1 }, { 1, 0 }, { 0, -1 }, { -1, 0 } };
int sx, sy, ex, ey, n, m;
bool onBoard(int x, int y) { return x >= 0 && y >= 0 && x < n && y < m; }
pair<int, int> dist[2000][2000];
void bfs()
{
    priority_queue<Node> pq;
    pq.push(Node(0, 0, sx, sy));
    while (!pq.empty()) {
        Node u = pq.top();
        pq.pop();
        for (int i = 0; i < 4; i++) {
            int tx = u.x + dir[i][0];
            int ty = u.y + dir[i][1];
            if (onBoard(tx, ty) && G[tx][ty] != '#'
                && dist[tx][ty] > make_pair(u.magic, u.step + 1)) {
                dist[tx][ty] = { u.magic, u.step + 1 };
                pq.push(Node(u.magic, u.step + 1, tx, ty));
            }
        }
        for (int i = -2; i <= 2; i++)
            for (int j = -2; j <= 2; j++) {
                int tx = u.x + i;
                int ty = u.y + j;
                if (onBoard(tx, ty) && G[tx][ty] != '#'
                    && dist[tx][ty] > make_pair(u.magic + 1, u.step + 1)) {
                    dist[tx][ty] = make_pair(u.magic + 1, u.step + 1);
                    pq.push(Node(u.magic + 1, u.step + 1, tx, ty));
                }
            }
    }
}
int main()
{
    io.R(n, m, sx, sy, ex, ey);
    G.resize(n, vector<char>(m));
    io >> G;
    --sx, --sy, --ex, --ey;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++) dist[i][j] = make_pair(INF, INF);
    bfs();
    io.WL(dist[ex][ey].first == INF ? -1 : dist[ex][ey].first);
    return 0;
}

Measured memory_bytes: 16700