// ---------- begin chmin, chmax ----------
pub trait ChangeMinMax {
    fn chmin(&mut self, x: Self) -> bool;
    fn chmax(&mut self, x: Self) -> bool;
}

impl<T: PartialOrd> ChangeMinMax for T {
    fn chmin(&mut self, x: Self) -> bool {
        *self > x && {
            *self = x;
            true
        }
    }
    fn chmax(&mut self, x: Self) -> bool {
        *self < x && {
            *self = x;
            true
        }
    }
}
// ---------- end chmin, chmax ----------
// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

use std::collections::*;

type Deque<T> = VecDeque<T>;

fn run() {
    input! {
        h: usize,
        w: usize,
        src: (usize, usize),
        dst: (usize, usize),
        a: [bytes; h],
    }
    let mut a = a;
    for a in a.iter_mut() {
        a.insert(0, b'#');
        a.push(b'#');
    }
    a.insert(0, vec![b'#'; w + 2]);
    a.push(vec![b'#'; w + 2]);
    type Dice = [u8; 6];
    fn rot(dice: &mut Dice, map: [usize; 6]) {
        let mut next = Dice::default();
        for (dice, map) in dice.iter().zip(&map) {
            next[*map] = *dice;
        }
        *dice = next;
    }
    fn left(x: usize) -> usize {
        let mut dice = [0; 6];
        dice[x] = 1;
        rot(&mut dice, [3, 0, 1, 2, 4, 5]);
        dice.iter().position(|d| *d == 1).unwrap()
    }
    fn right(x: usize) -> usize {
        let mut dice = [0; 6];
        dice[x] = 1;
        rot(&mut dice, [1, 2, 3, 0, 4, 5]);
        dice.iter().position(|d| *d == 1).unwrap()
    }
    fn up(x: usize) -> usize {
        let mut dice = [0; 6];
        dice[x] = 1;
        rot(&mut dice, [4, 1, 5, 3, 2, 0]);
        dice.iter().position(|d| *d == 1).unwrap()
    }
    fn down(x: usize) -> usize {
        let mut dice = [0; 6];
        dice[x] = 1;
        rot(&mut dice, [5, 1, 4, 3, 0, 2]);
        dice.iter().position(|d| *d == 1).unwrap()
    }
    let inf = 1000 * 1000 * 6i32;
    let mut dp = vec![vec![vec![inf; w + 2]; h + 2]; 6];
    dp[0][src.0][src.1] = 0;
    let mut deq = Deque::new();
    deq.push_back((0, src.0, src.1));
    while let Some((k, x, y)) = deq.pop_front() {
        let d = dp[k][x][y] + 1;
        let mut test = |dx: usize, dy: usize, f: &dyn Fn(usize) -> usize| {
            let x = x + dx;
            let y = y + dy;
            let k = (*f)(k);
            if a[x][y] == b'.' && dp[k][x][y].chmin(d) {
                deq.push_back((k, x, y));
            }
        };
        test(1, 0, &right);
        test(0, 1, &up);
        test(!0, 0, &left);
        test(0, !0, &down);
    }
    let mut ans = dp[0][dst.0][dst.1];
    if ans == inf {
        ans = -1;
    }
    println!("{}", ans);
}

fn main() {
    run();
}