#include <bits/stdc++.h>
#define Rep(i,a,b) for(int i = a; i <= b; ++i)
#define RepInv(i,a,b) for(int i = a; i >= b; --i)
#define rep(i,b) Rep(i,0,b-1)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")

using ll = long long;
using namespace std;
constexpr int inf = 1e9 + 7;
constexpr ll infll = 1ll << 60ll;
constexpr ll mod = 1e9 + 7;
// 0~3??????? 4~7?????
constexpr int dx[] = { 1, 0, -1, 0 };
constexpr int dy[] = { 0, 1, 0, -1 };
template <typename T, typename U> ostream& operator << (ostream& in, const pair<T, U>& A) {
  in << A.first << " " << A.second;
  return in;
}
namespace {
  template<typename T> bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
  template<typename T> bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
  // ????
  void Write(long long x, const char* end = "\n") { std::cout << x << end; }
  template <typename T> void Write(const T& x, const char* end = "\n") { std::cout << x << end; }
  template <typename T, typename U> void Write(const T& x, const U& y, const char* end = "\n") { std::cout << x << " " << y << end; }
  template <typename T, typename U, typename V> void Write(const T& x, const U& y, const V& z, const char* end = "\n") { std::cout << x << " " << y << " " << z << end; }
  //template <typename... Args> void Write(Args const&... args) { bool a = true; for (auto const& x : { args... }) { if (a) a = false; else std::cout << " "; std::cout << x; } std::cout << "\n"; }
  template <typename T> void Write(const std::vector<T>& x, char* sep = " ", const char* end = "\n") { for (std::size_t i = 0, sz = x.size(); i < sz; ++i) { std::cout << x[i] << (i == sz - 1 ? end : sep); } }
  template <typename T> void Writeln(const std::vector<T>& x, char* sep = "\n", const char* end = "\n") { for (std::size_t i = 0, sz = x.size(); i < sz; ++i) { std::cout << x[i] << (i == sz - 1 ? end : sep); } }
  template <typename T> void Write(const std::vector<std::vector<T>>& x, const char* sep = " ", const char* end = "\n") { for (auto v : x) Write(v, sep, end); }

  struct Read {
    std::size_t szi, szj;
    Read(std::size_t _szi = 1, std::size_t _szj = 1) : szi(_szi), szj(_szj) {}
    template <typename T> operator T () const { T a; std::cin >> a; return a; }
    template <typename T> operator std::vector<T>() const { std::vector<T> a(szi); for (std::size_t i = 0; i < szi; ++i) std::cin >> a[i]; return a; }
    template <typename T> operator std::vector<std::vector<T>>() const {
      std::vector<std::vector<T>> a(szi, std::vector<T>(szj));
      for (std::size_t i = 0; i < szi; ++i) for (std::size_t j = 0; j < szj; ++j) cin >> a[i][j]; return a;
    }
    template <typename T, typename U> operator std::vector<std::pair<T, U>>() const {
      std::vector<std::pair<T, U>> a(szi);
      for (std::size_t i = 0; i < szi; ++i) std::cin >> a[i].first >> a[i].second; return a;
    }
  };
  struct Read1 {
    std::size_t szi, szj;
    Read1(std::size_t _szi = 1, std::size_t _szj = 1) : szi(_szi), szj(_szj) {}
    template <typename T> operator T () const { T a; std::cin >> a; return a; }
    template <typename T> operator std::vector<T>() const { std::vector<T> a(szi + 1); for (std::size_t i = 1; i <= szi; ++i) std::cin >> a[i]; return a; }
    template <typename T> operator std::vector<std::vector<T>>() const {
      std::vector<std::vector<T>> a(szi, std::vector<T>(szj));
      for (std::size_t i = 1; i <= szi; ++i) for (std::size_t j = 1; j <= szj; ++j) cin >> a[i][j]; return a;
    }
    template <typename T, typename U> operator std::vector<std::pair<T, U>>() const {
      std::vector<std::pair<T, U>> a(szi);
      for (std::size_t i = 1; i <= szi; ++i) std::cin >> a[i].first >> a[i].second; return a;
    }
  };

  template <typename T> void Reads(T& a) { std::cin >> a; }
  template <typename T, typename U> void Reads(T& a, U& b) { std::cin >> a >> b; }
  template <typename T, typename U, typename V> void Reads(T& a, U& b, V& c) { std::cin >> a >> b >> c; }
  template <typename T, typename U, typename V, typename W> void Reads(T& a, U& b, V& c, W& d) { std::cin >> a >> b >> c >> d; }
  Read read;
  Read1 read1;
}
int h, w, Ch, Dh, Cw, Dw;
bool good(int i, int j, vector<vector<char>> &f) {
  return i >= 0 && j >= 0 && i <= h - 1 && j <= w - 1 && f[i][j] == '.';
}
int dijkstra(int start, int end, vector<int>&dist, vector<vector<pair<int, int>>> &list_copy) {
  dist[start] = 0;
  set<pair<int, int>> st;
  st.insert({ 0, start });
  while (!st.empty()) {
    int u = st.begin()->second;
    st.erase(st.begin());
    for (auto to : list_copy[u]) {
      int v = to.first;
      int w = to.second;
      if (dist[u] + w < dist[v]) {
        st.erase({ dist[v], v });
        dist[v] = dist[u] + w;
        st.insert({ dist[v], v });
      }
    }
  }
  return dist[end];
}
const int maxn = 1e6 + 67;
vector<vector<pair<int, int>>> g(maxn);
void testCase() {
  Reads(h, w);
  Reads(Ch, Cw, Dh, Dw);
  Ch--, Dh--, Cw--, Dw--;
  vector<vector<char>> f(h, vector<char>(w));
  vector<vector<int>> what(h, vector<int>(w));
  Rep(i, 0, h - 1) {
    Rep(j, 0, w - 1) {
      Reads(f[i][j]);
    }
  }
  int cnt = 0;
  Rep(i, 0, h - 1) {
    Rep(j, 0, w - 1) {
      what[i][j] = cnt++;
    }
  }
  Rep(i, 0, h - 1) {
    Rep(j, 0, w - 1) {
      Rep(k, 0, 3) {
         if (good(i + dx[k], j + dy[k], f)) {
           g[what[i][j]].push_back({ what[i + dx[k]][j + dy[k]], 0 });
         }
      }
    }
  }
  vector<int> DX = {-2, -2, -2, -2, -2, -1, -1, 0, 0, +1, +1, +2, +2, +2, +2, +2, -1, -1, +1, +1};
  vector<int> DY = {+2, +1, 0, -1, -2, +2, -2, +2, -2, +2, -2, +2, +1, 0, -1, -2, +1, -1, +1, -1};
  Rep(i, 0, h - 1) {
    Rep(j, 0, w - 1) {
      Rep(k, 0, 19) {
        if (good(i + DX[k], j + DY[k], f)) {
          g[what[i][j]].push_back({ what[i + DX[k]][j + DY[k]], 1 });
        }
      }
    }
  }
  vector<int> dist(cnt + 1, inf);
  int ans = dijkstra(what[Ch][Cw], what[Dh][Dw], dist, g);
  if (ans == inf) ans = -1;
  Write(ans);
}
signed main() {
  ios::sync_with_stdio(0);cin.tie(0);
  int q = 1;
  //Reads(q);
  while (q--)
    testCase();
}
/*1 3 3
1 1
1 2
1 3*/

Measured memory_bytes: 175244