#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int r, c, sy, sx, gy, gx; cin >> r >> c >> sy >> sx >> gy >> gx; --sy; --sx; --gy; --gx;
  vector<string> C(r); REP(i, r) cin >> C[i];
  vector<vector<int>> dist(r, vector<int>(c, INF));
  dist[sy][sx] = 0;
  queue<pair<int, int>> que;
  que.emplace(sy, sx);
  while (!que.empty()) {
    int i, j; tie(i, j) = que.front(); que.pop();
    REP(k, 4) {
      int y = (i + dy[k] + r) % r, x = (j + dx[k] + c) % c;
      if (dist[y][x] == INF) {
        dist[y][x] = dist[i][j] + 1;
        que.emplace(y, x);
      }
    }
  }
  cout << dist[gy][gx] << '\n';
  return 0;
}