Zigzag

Several points are given on a plane. We want to find a zigzag line that passes through all of them.

A zigzag line is a polyline made of several line segments joined end to end. It must satisfy the following rules.

• Every segment of the zigzag line must pass through at least two of the given points.
• Every given point must lie on the zigzag line; that is, each point must lie on at least one segment.

A point where the line bends is called a turning point. A turning point may or may not coincide with one of the given points. A zigzag line made of $s$ segments has $s - 1$ turning points.

We look for a zigzag line that satisfies the following two conditions, in this order of priority.

1. The number of turning points must be as small as possible.
2. Among lines with the same number of turning points, the total length must be as small as possible.

The length of each segment is the Euclidean distance between its two endpoints, and the length of the zigzag line is the sum of the lengths of all its segments. Because every segment must pass through at least two points, a longer line can sometimes be the answer.

Given the points, write a program that computes the number of turning points and the length of such a zigzag line.

The input consists of several test cases.

The first line of each test case contains the number of points $n$. Each of the next $n$ lines contains the coordinates $x$ and $y$ of one point, separated by a space.

All coordinates are non-negative integers. $n$ is an integer with $2 \le n \le 10$, and $x$ and $y$ are integers with $0 \le x, y \le 10$. The order in which the points are given does not matter, and all points are distinct.

The last line contains $0$, which marks the end of the input.

For each test case, print on one line the number of turning points and the length of the shortest zigzag line among those with the fewest turning points, separated by a space.

Print the number of turning points as an integer, and print the length rounded to six decimal places.

The minimum number of turning points is at most $4$, so the number of segments is at most $5$.