시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
2 초 512 MB 11 5 3 33.333%

문제

Vera is an astronomer studying locality of nearby star systems. The star systems can be thought of as 3D points in space. Vera would like to place a can around the stars. In other words, she would like to know what is the smallest volume cylinder that encloses the stars. The cylinder can be oriented in any direction. At least one base of the cylinder must have at least three stars.

입력

Each input will consist of a single test case. Note that your program may be run multiple times on different inputs. The first line of input will contain a single integer n (4 ≤ n ≤ 1,000), representing the number of stars.

Each of the next n lines will contain three integers x, y and z (−1,000 ≤ x, y, z ≤ 1,000), representing the position of a single star. No two stars will be at the same position. No four stars will be coplanar.

출력

Output a floating point number representing the smallest volume cylinder that can enclose all the stars. Your answer must be accurate within a relative tolerance of 10−6.

예제 입력

4
1 0 0
1 1 0
0 0 0
0 0 1

예제 출력

1.57079633

예제 입력 2

4
-100 0 0
10 0 10
-10 -10 -10
0 0 0

예제 출력 2

41938.65135885

예제 입력 3

7
10 20 30
0 0 0
-100 1000 -20
100 -20 33
8 -7 900
-100 -223 -23
3 0 3

예제 출력 3

298192571.11934924

힌트