B"Little Petya is learning to play chess. He has already learned how to move a king, a rook and a bishop. Let us remind you the rules of moving chess pieces. A chessboard is 64 square fields organized into an 8 xe2 x80 x89 xc3 x97 xe2 x80 x898 table. A field is represented by a pair of integers (r, xe2 x80 x89c) -- the number of the row and the number of the column (in a classical game the columns are traditionally indexed by letters). Each chess piece takes up exactly one field. To make a move is to move a chess piece, the pieces move by the following rules: Petya is thinking about the following problem: what minimum number of moves is needed for each of these pieces to move from field (r1, xe2 x80 x89c1) to field (r2, xe2 x80 x89c2)? At that, we assume that there are no more pieces besides this one on the board. Help him solve this problem. The input contains four integers r1, xe2 x80 x89c1, xe2 x80 x89r2, xe2 x80 x89c2 (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89r1, xe2 x80 x89c1, xe2 x80 x89r2, xe2 x80 x89c2 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x898) -- the coordinates of the starting and the final field. The starting field doesn't coincide with the final one. You can assume that the chessboard rows are numbered from top to bottom 1 through 8, and the columns are numbered from left to right 1 through 8. Print three space-separated integers: the minimum number of moves the rook, the bishop and the king (in this order) is needed to move from field (r1, xe2 x80 x89c1) to field (r2, xe2 x80 x89c2). If a piece cannot make such a move, print a 0 instead of the corresponding number."...