from collections import deque
import sys

def main():
    R, C = map(int, sys.stdin.readline().split())
    sy, sx = map(int, sys.stdin.readline().split())
    gy, gx = map(int, sys.stdin.readline().split())
    sy -= 1
    sx -= 1
    gy -= 1
    gx -= 1

    maze = [sys.stdin.readline().strip() for _ in range(R)]

    dist = [[-1] * C for _ in range(R)]
    q = deque()
    dist[sy][sx] = 0
    q.append((sy, sx))

    dx = [1, 0, -1, 0]
    dy = [0, 1, 0, -1]

    while q:
        y, x = q.popleft()
        if y == gy and x == gx:
            print(dist[y][x])
            return
        for i in range(4):
            ny = y + dy[i]
            nx = x + dx[i]
            if 0 <= ny < R and 0 <= nx < C:
                if maze[ny][nx] == '.' and dist[ny][nx] == -1:
                    dist[ny][nx] = dist[y][x] + 1
                    q.append((ny, nx))

if __name__ == "__main__":
    main()