#![allow(non_snake_case)]
#![allow(dead_code)]
#![allow(unused_macros)]
#![allow(unused_imports)]

use std::str::FromStr;
use std::io::*;
use std::collections::*;
use std::cmp::*;

struct Scanner<I: Iterator<Item = char>> {
    iter: std::iter::Peekable<I>,
}

macro_rules! exit {
    () => {{
        exit!(0)
    }};
    ($code:expr) => {{
        if cfg!(local) {
            writeln!(std::io::stderr(), "===== Terminated =====")
                .expect("failed printing to stderr");
        }
        std::process::exit($code);
    }}
}

impl<I: Iterator<Item = char>> Scanner<I> {
    pub fn new(iter: I) -> Scanner<I> {
        Scanner {
            iter: iter.peekable(),
        }
    }

    pub fn safe_get_token(&mut self) -> Option<String> {
        let token = self.iter
            .by_ref()
            .skip_while(|c| c.is_whitespace())
            .take_while(|c| !c.is_whitespace())
            .collect::<String>();
        if token.is_empty() {
            None
        } else {
            Some(token)
        }
    }

    pub fn token(&mut self) -> String {
        self.safe_get_token().unwrap_or_else(|| exit!())
    }

    pub fn get<T: FromStr>(&mut self) -> T {
        self.token().parse::<T>().unwrap_or_else(|_| exit!())
    }

    pub fn vec<T: FromStr>(&mut self, len: usize) -> Vec<T> {
        (0..len).map(|_| self.get()).collect()
    }

    pub fn mat<T: FromStr>(&mut self, row: usize, col: usize) -> Vec<Vec<T>> {
        (0..row).map(|_| self.vec(col)).collect()
    }

    pub fn char(&mut self) -> char {
        self.iter.next().unwrap_or_else(|| exit!())
    }

    pub fn chars(&mut self) -> Vec<char> {
        self.get::<String>().chars().collect()
    }

    pub fn mat_chars(&mut self, row: usize) -> Vec<Vec<char>> {
        (0..row).map(|_| self.chars()).collect()
    }

    pub fn line(&mut self) -> String {
        if self.peek().is_some() {
            self.iter
                .by_ref()
                .take_while(|&c| !(c == '\n' || c == '\r'))
                .collect::<String>()
        } else {
            exit!();
        }
    }

    pub fn peek(&mut self) -> Option<&char> {
        self.iter.peek()
    }
}

const DI: [i64; 4] = [-1, 0, 1, 0];
const DJ: [i64; 4] = [0, -1, 0, 1];

fn main() {
    let cin = stdin();
    let cin = cin.lock();
    let mut sc = Scanner::new(cin.bytes().map(|c| c.unwrap() as char));
    let H: usize = sc.get();
    let W: usize = sc.get();
    let Ch: usize = sc.get::<usize>()-1;
    let Cw: usize = sc.get::<usize>()-1;
    let Dh: usize = sc.get::<usize>()-1;
    let Dw: usize = sc.get::<usize>()-1;
    let S: Vec<Vec<char>> = sc.mat_chars(H);
    let mut q = VecDeque::new();
    let mut dist = vec![vec![-1; W]; H];
    q.push_back((Ch, Cw));
    let mut cnt = 0;
    loop {
        let mut nq = VecDeque::new();
        let mut end = true;
        while let Some((i, j)) = q.pop_front() {
            if dist[i][j] != -1 {
                continue;
            }
            dist[i][j] = cnt;
            end = false;
            for d in 0..4 {
                let ni = i as i64 + DI[d];
                let nj = j as i64 + DJ[d];
                if ni < 0 || ni >= H as i64 || nj < 0 || nj >= W as i64 {
                    continue;
                }
                let ni = ni as usize;
                let nj = nj as usize;
                if dist[ni][nj] != -1 {
                    continue;
                }
                if S[ni][nj] == '.' {
                    dist[ni][nj] = min(dist[ni][nj], cnt);
                    q.push_back((ni, nj));
                }
            }
            for di in -2..3 {
                let ni = i as i64 + di;
                if ni < 0 || ni >= H as i64 {
                    continue;
                }
                for dj in -2..3 {
                    let nj = j as i64 + dj;
                    if nj < 0 || nj >= W as i64 {
                        continue;
                    }
                    if ni == i as i64 && nj == j as i64 {
                        continue;
                    }
                    let ni = ni as usize;
                    let nj = nj as usize;
                    if S[ni][nj] == '.' {
                        nq.push_back((ni, nj));
                    }
                }
            }
        }
        cnt += 1;
        if end {
            break;
        }
        q = nq;
    }
    println!("{}", dist[Dh][Dw]);
}


Measured memory_bytes: 14296