#include <bits/stdc++.h>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

//繰り返し二乗法
ll mod_pow(ll a, ll n, ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%m;
		a = a * a%m; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

//逆元(Eucledean algorithm)
ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;

int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };


struct Object {
    // 任意の構造体
    ll x;
    ll y;
    ll dist;
};
 
priority_queue<tuple<ll, ll, ll>, vector<tuple<ll, ll, ll>>, greater<tuple<ll, ll, ll>>> q;
vector<string> strv;
ll sy, sx, gy, gx;
int n, m;
vector<vector<ll>> memo;
 
ll bfs() {
    while (!q.empty()) {
        // キューの先頭の要素を取り出す dequeue(pop)
        auto now = q.top(); q.pop();
 
        // 停止条件
        // if (now.hoge == target) return ~;  // 探索対象
        // if (now.x == gx && now.y == gy) return now.dist;

        Rep1(i, -2, 2){
            Rep1(j, -2, 2){
                ll next_y = get<2>(now) + i;
                ll next_x = get<1>(now) + j;
                ll next_dist = get<0>(now);
                if(abs(i)+abs(j) > 1) next_dist++;
                if(i == 0 && j == 0) continue;
                if(next_x < 0 || next_x >= m || next_y <0 || next_y >= n) continue;
                if(strv[next_y][next_x] == '#') continue;
                if(memo[next_y][next_x] <= next_dist) continue;
                tuple<ll, ll, ll> next = {next_dist, next_x, next_y};
                q.push(next);
                memo[next_y][next_x] = next_dist;
            }
        }
        
        // BFS
        // rep(i, 4){
        //     ll next_x = now.x + dx[i];
        //     ll next_y = now.y + dy[i];
        //     if(next_x < 0 || next_x >= m || next_y <0 || next_y >= n || memo[next_y][next_x]) continue;
        //     if(strv[next_y][next_x] == '#'){
        //         if(now.dist >= 2) continue;
        //         Object next = {next_x, next_y, now.dist+1};
        //         q.push_back(next);
        //     }else{
        //         Object next = {next_x, next_y, now.dist};
        //         q.push_front(next);
        //     }
        //     memo[next_y][next_x] = 1;
        // }
    }
    return 0;
}

void solve() {
    cin >> n >> m;
    cin >> sy >> sx >> gy >> gx;
    sy--; sx--; gy--; gx--;
    strv.resize(n);
    memo.resize(n, vector<ll>(m, INF));
    rep(i, n) cin >> strv[i];
    q.push({0, sx, sy});
    memo[sy][sx] = 0;
    bfs();
    if(memo[gy][gx] == INF) cout << -1 << endl;
    else cout << memo[gy][gx] << endl;
}

signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  //cout << fixed << setprecision(10);
  //init_f();
  //init();
  //int t; cin >> t; rep(i, t)solve();
  solve();
//   stop
    return 0;
}


Measured memory_bytes: 16748