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 × 8 table. A field is represented by a pair of integers (*r*, *c*) — 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:
 -  A rook moves any number of fields horizontally or vertically. -  A bishop moves any number of fields diagonally. -  A king moves one field in any direction — horizontally, vertically or diagonally. 
Petya is thinking about the following problem: what minimum number of moves is needed for each of these pieces to move from field (*r*<sub class="lower-index">1</sub>, *c*<sub class="lower-index">1</sub>) to field (*r*<sub class="lower-index">2</sub>, *c*<sub class="lower-index">2</sub>)? 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 *r*<sub class="lower-index">1</sub>, *c*<sub class="lower-index">1</sub>, *r*<sub class="lower-index">2</sub>, *c*<sub class="lower-index">2</sub> (1 ≤ *r*<sub class="lower-index">1</sub>, *c*<sub class="lower-index">1</sub>, *r*<sub class="lower-index">2</sub>, *c*<sub class="lower-index">2</sub> ≤ 8) — 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.
#https://codeforces.com/problemset/problem/370/A

def main():
	#read input (starting and end coordinates)
	start_row, start_col, end_row, end_col = (int(i) for i in input().split())


	'''rook: the rook can go to every position in at most 2 moves. 
	if the end position is at the same row or column,it only needs 1 move'''
	if start_row == end_row or start_col == end_col:
		moves_rook = 1
	else:
		moves_rook = 2

	'''bishop: the bishop can't get to every position in the board.
	it can only get to those fields that are of the same color of
	the field that he is on. For these positions, he can get at every one
	in at most 2 moves. likewise the rook, if the end position is 
	on the same diagonal he only needs 1 move
	'''
	color_start_p = get_color(start_row, start_col)
	color_end_p = get_color(end_row, end_col)
	if color_start_p == color_end_p:
		# to positions are on the same diagonal if |r1-r2| = |c1-c2|
		if abs(start_row - end_row) == abs(start_col - end_col):
			moves_bishop =  1
		else:
			moves_bishop = 2
	else:
		moves_bishop = 0

	'''king: the king can get to any position on the board.
	the fastest way to get to a position is to move diagonally until you reach
	the desired row or col, and the move straight.
	'''
	if abs(start_row - end_row) < abs(start_col-end_col):
		moves_king = abs(start_col - end_col)
	else:
		moves_king = abs(start_row - end_row)

	print(moves_rook, moves_bishop, moves_king)




def get_color(r,c):
	if r % 2 == 0:
		if c % 2 == 0:
			return 1
		else:
			return -1
	else:
		if c % 2 == 0:
			return -1
		else:
			return 1

if __name__ == "__main__":
	main()