Square
Given a triangle on a plane, defined by the coordinates of its vertices: (X_1, Y_1), (X_2, Y_2), (X_3, Y_3), determine the side length L of the smallest square that can completely enclose the triangle, ensuring all vertices are either inside or on the boundary of the square.
Develop a program, SQUARE, that calculates the side length L of this minimal enclosing square, based on the provided vertex coordinates. The result should be accurate to 10^{-4}.
Input
The input consists of a single line containing six real numbers: X_1 Y_1 X_2 Y_2 X_3 Y_3, separated by spaces. These numbers represent the coordinates of the triangle's vertices, with each coordinate satisfying the condition -10000 ≤ X_1, Y_1, X_2, Y_2, X_3, Y_3 ≤ 10000.
Output
Output a single number, which is the side length L of the required square.