#include using namespace std; typedef long long ll; #define pb(x) push_back(x) #define mp(a, b) make_pair(a, b) #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define lscan(x) scanf("%I64d", &x) #define lprint(x) printf("%I64d", x) #define rep(i, n) for (ll i = 0; i < (n); i++) #define rep2(i, n) for (ll i = (ll)n - 1; i >= 0; i--) #define REP(i, l, r) for (ll i = l; i < (r); i++) #define REP2(i, l, r) for (ll i = (ll)r - 1; i >= (l); i--) #define siz(x) (ll)x.size() template using rque = priority_queue, greater>; const ll mod = (int)1e9 + 7; template bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; } template bool chmax(T &a, const T &b) { if (b > a) { a = b; return 1; } return 0; } ll gcd(ll a, ll b) { if(a == 0) return b; if(b == 0) return a; ll cnt = a % b; while (cnt != 0) { a = b; b = cnt; cnt = a % b; } return b; } long long extGCD(long long a, long long b, long long &x, long long &y) { if (b == 0) { x = 1; y = 0; return a; } long long d = extGCD(b, a % b, y, x); y -= a / b * x; return d; } struct UnionFind { vector data; int num; UnionFind(int sz) { data.assign(sz, -1); num = sz; } bool unite(int x, int y) { x = find(x), y = find(y); if (x == y) return (false); if (data[x] > data[y]) swap(x, y); data[x] += data[y]; data[y] = x; num--; return (true); } int find(int k) { if (data[k] < 0) return (k); return (data[k] = find(data[k])); } ll size(int k) { return (-data[find(k)]); } bool same(int x, int y){ return find(x) == find(y); } }; ll M = 1000000007; template struct ModInt { int x; ModInt() : x(0) {} ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} ModInt &operator+=(const ModInt &p) { if ((x += p.x) >= mod) x -= mod; return *this; } ModInt &operator-=(const ModInt &p) { if ((x += mod - p.x) >= mod) x -= mod; return *this; } ModInt &operator*=(const ModInt &p) { x = (int)(1LL * x * p.x % mod); return *this; } ModInt &operator/=(const ModInt &p) { *this *= p.inverse(); return *this; } ModInt operator-() const { return ModInt(-x); } ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; } ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; } ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; } ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; } bool operator==(const ModInt &p) const { return x == p.x; } bool operator!=(const ModInt &p) const { return x != p.x; } ModInt inverse() const { int a = x, b = mod, u = 1, v = 0, t; while (b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); } return ModInt(u); } ModInt pow(int64_t n) const { ModInt ret(1), mul(x); while (n > 0) { if (n & 1) ret *= mul; mul *= mul; n >>= 1; } return ret; } friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; } friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt(t); return (is); } static int get_mod() { return mod; } }; using mint = ModInt; mint mpow(mint x, ll n) { mint ans = 1; while (n != 0) { if (n & 1) ans *= x; x *= x; n = n >> 1; } return ans; } ll mpow2(ll x, ll n, ll mod) { ll ans = 1; while (n != 0) { if (n & 1) ans = ans * x % mod; x = x * x % mod; n = n >> 1; } return ans; } vector fac; vector ifac; void setcomb(int sz = 2000010) { fac.assign(sz + 1, 0); ifac.assign(sz + 1, 0); fac[0] = 1; for (ll i = 0; i < sz; i++) { fac[i + 1] = fac[i] * (i + 1); // n!(mod M) } ifac[sz] = fac[sz].inverse(); for (ll i = sz; i > 0; i--) { ifac[i - 1] = ifac[i] * i; } } mint comb(ll a, ll b) { if(fac.size() == 0) setcomb(); if (a == 0 && b == 0) return 1; if (a < b || a < 0 || b < 0) return 0; return ifac[a - b] * ifac[b] * fac[a]; } mint perm(ll a, ll b) { if(fac.size() == 0) setcomb(); if (a == 0 && b == 0) return 1; if (a < b || a < 0) return 0; return fac[a] * ifac[a - b]; } long long modinv(long long a) { long long b = M, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } u %= M; if (u < 0) u += M; return u; } ll modinv2(ll a, ll mod) { ll b = mod, u = 1, v = 0; while (b) { ll t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } u %= mod; if (u < 0) u += mod; return u; } int main(){ ios::sync_with_stdio(false); std::cin.tie(nullptr); ll h, w, sy, sx, gy, gx; cin >> h >> w >> sy >> sx >> gy >> gx; sy--, sx--, gy--, gx--; string s[h]; rep(i, h) cin >> s[i]; unordered_map d; int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1}; vector> rot(4); rot[0] = {3, 1, 0, 5, 4, 2}; rot[1] = {1, 5, 2, 3, 0, 4}; rot[2] = {2, 1, 5, 0, 4, 3}; rot[3] = {4, 0, 2, 3, 5, 1}; queue que; d[sy + sx * 1000 + 12345ll * 1000000] = 1; que.push(sy + sx * 1000 + 12345ll * 1000000); while(!que.empty()){ ll ncond = que.front(); ll ccond = ncond; que.pop(); ll ny = ccond % 1000; ccond /= 1000; ll nx = ccond % 1000; ccond /= 1000; ll di[6]; rep2(i,6){ di[i] = ccond % 10; ccond /= 10; } // cout << ny << " " << nx << " "; // rep(i, 6) cout << di[i]; // cout << endl; rep(dir, 4){ ll ney = ny + dy[dir], nex = nx + dx[dir]; if(ney < 0 || ney >= h || nex < 0 || nex >= w) continue; if(s[ney][nex] == '#') continue; ll ndi[6]; rep(i, 6) ndi[i] = di[rot[dir][i]]; if(ney == gy && nex == gx && ndi[0] == 0){ cout << d[ncond] << endl; return 0; } ll necond = ney + nex * 1000; ll p = 1000000; rep2(i, 6) necond += ndi[i] * p, p *= 10; if(d[necond] == 0){ d[necond] = d[ncond] + 1; que.push(necond); } } } cout << -1 << endl; }