You are constructing a triangular pyramid with a sheet of craft paper with grid lines. Its base and sides are all of triangular shape. You draw the base triangle and the three sides connected to the base on the paper, cut along the outer six edges, fold the edges of the base, and assemble them up as a pyramid.

You are given the coordinates of the base’s three vertices, and are to determine the coordinates of the other three. All the vertices must have integral X- and Y-coordinate values between −100 and +100 inclusive. Your goal is to minimize the height of the pyramid satisfying these conditions. Figure 3 shows some examples.

Figure 3: Some craft paper drawings and side views of the assembled pyramids

The input consists of multiple datasets, each in the following format.

X₀ Y₀ X₁ Y₁ X₂ Y₂

They are all integral numbers between −100 and +100 inclusive. (X₀, Y₀), (X₁, Y₁), (X₂, Y₂) are the coordinates of three vertices of the triangular base in counterclockwise order.

The end of the input is indicated by a line containing six zeros separated by a single space.

For each dataset, answer a single number in a separate line. If you can choose three vertices (X_a, Y_a), (X_b, Y_b) and (X_c, Y_c) whose coordinates are all integral values between −100 and +100 inclusive, and triangles (X₀, Y₀)–(X₁, Y₁)–(X_a, Y_a), (X₁, Y₁)–(X₂, Y₂)–(X_b, Y_b), (X₂, Y₂)–(X₀, Y₀)–(X_c, Y_c) and (X₀, Y₀)–(X₁, Y₁)–(X₂, Y₂) do not overlap each other (in the XY-plane), and can be assembled as a triangular pyramid of positive (non-zero) height, output the minimum height among such pyramids. Otherwise, output −1.

You may assume that the height is, if positive (non-zero), not less than 0.00001. The output should not contain an error greater than 0.00001.