A regular convex polygon is a polygon where each side has the same length, and all interior angles are equal and less than 180 degrees. A square, for example, is a regular convex polygon. You are given three points which are vertices of a regular convex polygon R; can you determine the minimum number of vertices that R must have?

Each test case consists of three lines. Line i consists of two floating point values xi and yi (-10⁴ <=x1, y1 <= 10⁴) where (xi; yi) are the coordinates of a vertex of R. The coordinates are given with a precision of 10^-6, i.e., they dier 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 1, and R has at most 1000 vertices. The input will nish with a line containing the word END.

For each test case, print one line with the minimum number of vertices that R must have.