Regular Convex Polygon#3072
A regular convex polygon is a polygon where each side has the same length, and all interior angles are equal and less than degrees. A square, for example, is a regular convex polygon. You are given three points which are vertices of a regular convex polygon ; can you determine the minimum number of vertices that must have?
Each test case consists of three lines. Line consists of two floating point values x_i and y_i (-10^4 \le x_i, y_i \le 10^4) where (x_i, y_i) are the coordinates of a vertex of . The coordinates are given with a precision of 10^{-6}, i.e., they differ from the exact coordinates by at most 10^{-6}. You may assume that for each test case the Euclidean distance between any two given points is at least , and has at most vertices. The input will finish with a line containing the word .
For each test case, print one line with the minimum number of vertices that must have.
Example 1