Problem: A maze is composed of a grid of H \times W squares - H vertical, W horizontal.

The square at the i-th row from the top and the j-th column from the left - (i,j) - is a wall if S_{ij} is `#` and a road if S_{ij} is `.`.

There is a magician in (C_h,C_w). He can do the following two kinds of moves:

* Move A: Walk to a road square that is vertically or horizontally adjacent to the square he is currently in.
* Move B: Use magic to warp himself to a road square in the 5\times 5 area centered at the square he is currently in.



In either case, he cannot go out of the maze.

At least how many times does he need to use the magic to reach (D_h, D_w)?

Constraints

* 1 \leq H,W \leq 10^3
* 1 \leq C_h,D_h \leq H
* 1 \leq C_w,D_w \leq W
* S_{ij} is `#` or `.`.
* S_{C_h C_w} and S_{D_h D_w} are `.`.
* (C_h,C_w) \neq (D_h,D_w)

Input

Input is given from Standard Input in the following format:


H W
C_h C_w
D_h D_w
S_{11}\ldots S_{1W}
\vdots
S_{H1}\ldots S_{HW}


Output

Print the minimum number of times the magician needs to use the magic. If he cannot reach (D_h,D_w), print `-1` instead.

Examples

Input

4 4
1 1
4 4
..#.
..#.
.#..
.#..


Output

1


Input

4 4
1 4
4 1
.##.


.##.


Output

-1


Input

4 4
2 2
3 3
....
....
....
....


Output

0


Input

4 5
1 2
2 5
.###
.
..##
..##


Output

2

Solution (in JAVA):

Solution:
import java.util.ArrayDeque;
import java.util.Deque;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		new Main().run();
	}

	int h;
	int w;
	int ch;
	int cw;
	int dh;
	int dw;

	String[] s;
	int[][] visited;
	int[][] wvisited;

	public void run() {
		Scanner sc = new Scanner(System.in);

		h = sc.nextInt();
		w = sc.nextInt();
		ch = sc.nextInt()-1;
		cw = sc.nextInt()-1;
		dh = sc.nextInt()-1;
		dw = sc.nextInt()-1;

		s = new String[h];
		for (int i = 0; i < h; i++) {
			s[i] = sc.next();
		}
		visited = new int[h][w];
		wvisited = new int[h][w];

		int r = bfs(h, w, ch, cw, dh, dw, s);

		System.out.println(r);
	}

	private int bfs(int h, int w, int ch, int cw, int dh, int dw, String[] s) {
		Queue<Pos> wqueue = new PriorityQueue<>();
		Deque<Pos> queue = new ArrayDeque<>();

		wqueue.add(new Pos(ch, cw));

		int warp = 0;
		Pos wnode;
		while ((wnode = wqueue.poll()) != null) {
			queue.add(wnode);

			Pos node;
			while ((node = queue.poll()) != null) {
				int h2 = node.h;
				int w2 = node.w;
				if (visited[h2][w2] != 0) {
					continue;
				}
				if (s[h2].charAt(w2) == '#') {
					continue;
				}

				if (h2 == dh && w2 == dw) {
					return wnode.warp;
				}
				visited[h2][w2]++;

				addQueue(queue, h2, w2 - 1);
				addQueue(queue, h2, w2 + 1);
				addQueue(queue, h2 - 1, w2);
				addQueue(queue, h2 + 1, w2);

				addWQueue(wqueue, h2 - 2, w2 - 2, wnode.warp );
				addWQueue(wqueue, h2 - 1, w2 - 2, wnode.warp);
				addWQueue(wqueue, h2 - 0, w2 - 2, wnode.warp);
				addWQueue(wqueue, h2 + 1, w2 - 2, wnode.warp);
				addWQueue(wqueue, h2 + 2, w2 - 2, wnode.warp);

				addWQueue(wqueue, h2 - 2, w2 - 1, wnode.warp);
				addWQueue(wqueue, h2 - 1, w2 - 1, wnode.warp);
				// addWQueue(wqueue, node.h - 0, node.w - 1, wnode.warp);
				addWQueue(wqueue, h2 + 1, w2 - 1, wnode.warp);
				addWQueue(wqueue, h2 + 2, w2 - 1, wnode.warp);

				addWQueue(wqueue, h2 - 2, w2 - 0, wnode.warp);
				// addWQueue(wqueue, node.h - 1, node.w - 0, wnode.warp);
				// addWQueue(wqueue, node.h - 0, node.w - 0, wnode.warp);
				// addWQueue(wqueue, node.h + 1, node.w - 0, wnode.warp);
				addWQueue(wqueue, h2 + 2, w2 - 0, wnode.warp);

				addWQueue(wqueue, h2 - 2, w2 + 1, wnode.warp);
				addWQueue(wqueue, h2 - 1, w2 + 1, wnode.warp);
				// addWQueue(wqueue, node.h - 0, node.w + 1, wnode.warp);
				addWQueue(wqueue, h2 + 1, w2 + 1, wnode.warp);
				addWQueue(wqueue, h2 + 2, w2 + 1, wnode.warp);

				addWQueue(wqueue, h2 - 2, w2 + 2, wnode.warp);
				addWQueue(wqueue, h2 - 1, w2 + 2, wnode.warp);
				addWQueue(wqueue, h2 - 0, w2 + 2, wnode.warp);
				addWQueue(wqueue, h2 + 1, w2 + 2, wnode.warp);
				addWQueue(wqueue, h2 + 2, w2 + 2, wnode.warp);

			}
		}
		return -1;
	}

	private void addQueue(Queue<Pos> queue, int h2, int w2) {
		if (h2 < 0 || h <= h2)
			return;
		if (w2 < 0 || w <= w2)
			return;

		queue.add(new Pos(h2, w2));
	}

	private void addWQueue(Queue<Pos> wqueue, int h2, int w2, int wrapc) {
		if (h2 < 0 || h <= h2)
			return;
		if (w2 < 0 || w <= w2)
			return;
		if (visited[h2][w2] != 0) {
			return;
		}
		if (s[h2].charAt(w2) == '#') {
			return;
		}

		Pos e = new Pos(h2, w2, wrapc+1);
		wqueue.add(e);
	}

}

class Pos implements Comparable{

	public Pos(int h, int w) {
		super();
		this.h = h;
		this.w = w;
	}


	public Pos(int h, int w, int warp) {
		super();
		this.h = h;
		this.w = w;
		this.warp = warp;
	}


	@Override
	public int hashCode() {
		final int prime = 31;
		int result = 1;
		result = prime * result + h;
		result = prime * result + w;
		result = prime * result + warp;
		return result;
	}


	@Override
	public boolean equals(Object obj) {
		if (this == obj)
			return true;
		if (obj == null)
			return false;
		if (getClass() != obj.getClass())
			return false;
		Pos other = (Pos) obj;
		if (h != other.h)
			return false;
		if (w != other.w)
			return false;
		if (warp != other.warp)
			return false;
		return true;
	}


	int h;
	int w;
	
	int warp;

	@Override
	public int compareTo(Object o) {
		Pos t = (Pos) o;
		int dwarp = warp-t.warp;
		if( dwarp != 0)
			return dwarp;
		
		int dw = w-t.w;
		if( dw != 0)
			return dw;
		
		int dh = h - t.h;
		return dh;
		
	}
}