Problem: Given several points on a plane, let’s try to solve a puzzle connecting them with a zigzag line. The puzzle is to find the zigzag line that passes through all the given points with the minimum number of turns. Moreover, when there are several zigzag lines with the minimum number of turns, the shortest one among them should be found.

For example, consider nine points given in Figure 1.

<image>

Figure 1: Given nine points

A zigzag line is composed of several straight line segments. Here, the rule requests that each line segment should pass through two or more given points.

A zigzag line may turn at some of the given points or anywhere else. There may be some given points passed more than once.

<image>

Figure 2: Zigzag lines with three turning points.

Two zigzag lines with three turning points are depicted in Figure 2 (a) and (b) for the same set of given points shown in Figure 1. The length of the zigzag line in Figure 2 (a) is shorter than that in Figure 2 (b). In fact, the length of the zigzag line in Figure 2 (a) is the shortest so that it is the solution for the nine points given in Figure 1.

Another zigzag line with four turning points is depicted in Figure 3. Its length is shorter than those in Figure 2, however, the number of turning points is greater than those in Figure 2, and thus, it is not the solution.

<image>

Figure 3: Zigzag line with four turning points.

There are two zigzag lines that passes another set of given points depicted in Figure 4 (a) and (b).

Both have the same number of turning points, and the line in (a) is longer than that in (b). However, the solution is (a), because one of the segments of the zigzag line in (b) passes only one given point, violating the rule.

<image>

Figure 4: Zigzag line with two turning points (a), and not a zigzag line concerned (b).

Your job is to write a program that solves this puzzle.



Input

The input consists of multiple datasets, followed by a line containing one zero. Each dataset has the following format.


n
x1 y1
.
.
.
xn yn


Every input item in a dataset is a non-negative integer. Items in a line are separated by a single space.

n is the number of the given points. xk and yk (k = 1, . . . , n) indicate the position of the k-th point. The order of the points is meaningless. You can assume that 2 ≤ n ≤ 10, 0 ≤ xk ≤ 10, and 0 ≤ yk ≤ 10.

Output

For each dataset, the minimum number of turning points and the length of the shortest zigzag line with that number of turning points should be printed, separated by a space in a line. The length should be in a decimal fraction with an error less than 0.0001 (= 1.0 × 10-4 ).

You may assume that the minimum number of turning points is at most four, that is, the number of line segments is at most five.

The example solutions for the first four datasets in the sample input are depicted in Figure 5 and 6.

Example

Input

2
0 0
10 9
4
0 0
3 1
0 3
3 3
10
2 2
4 2
6 2
2 4
4 4
6 4
2 6
4 6
6 6
3 3
10
0 0
2 0
4 0
0 2
2 2
4 2
0 4
2 4
4 4
6 8
9
0 0
1 0
3 0
0 1
1 1
3 1
0 2
1 2
2 2
10
0 0
1 0
0 1
1 1
9 9
9 10
10 9
10 10
0 2
10 8
10
0 0
0 10
2 0
2 1
2 7
2 10
5 1
6 7
9 2
10 9
0


Output

0 13.45362405
1 18.48683298
3 24.14213562
4 24.94813673
3 12.24264069
3 60.78289622
3 502.7804353

Solution (in CPP):

Solution:
#include <cstdio>
#include <complex>
#include <queue>
#include <cmath>
#include <vector>
#include <cassert>
#include <cstring>
#include <algorithm>
using namespace std;

#define EPS 1e-8

typedef complex<double> P;

struct L : public vector<P> {
  L(const P &a, const P &b) {
    push_back(a); push_back(b);
  }
};

double cross(const P& a, const P& b) {
  return imag(conj(a)*b);
}

double dist(const P& a, const P& b)
{
	return sqrt((a.real()-b.real())*(a.real()-b.real())+(a.imag()-b.imag())*(a.imag()-b.imag()));
}

bool intersectLL(const L &l, const L &m) {
  return abs(cross(l[1]-l[0], m[1]-m[0])) > EPS || // non-parallel
         abs(cross(l[1]-l[0], m[0]-l[0])) < EPS;   // same line
}

bool intersectLP(const L &l, const P &p) {
  return abs(cross(l[1]-p, l[0]-p)) < EPS;
}

bool intersectSP(const L &s, const P &p) {
  return abs(s[0]-p)+abs(s[1]-p)-abs(s[1]-s[0]) < EPS; // triangle inequality
}

P crosspoint(const L &l, const L &m) {
  double A = cross(l[1] - l[0], m[1] - m[0]);
  double B = cross(l[1] - l[0], l[1] - m[0]);
  if (abs(A) < EPS && abs(B) < EPS) return m[0]; // same line
  if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!
  return m[0] + B / A * (m[1] - m[0]);
}

class Edge
{
public:
	int to,l,pt;
	double c;
	Edge(int to, int l, double c, int pt)
	:to(to), l(l), c(c), pt(pt)
	{}
};

class Trl
{
public:
	int p,l,t,h,pts;
	double c;
	Trl(int p, int l, int t, int h, double c)
	:p(p),l(l),t(t),c(c),h(h)
	{}
	
	bool operator<(const Trl& a) const
	{
		if(t!=a.t) return t>a.t;
		return c>a.c;
	}
};

typedef vector<Edge> Node;
Node node[1000];
int N;
bool v[1<<10][1000];

bool isequal(const P& a, const P& b)
{
	double rd=a.real()-b.real();
	double id=a.imag()-b.imag();
	
	return (fabs(rd) < EPS && fabs(id) < EPS);
}

void MakeGraph(vector<L>& Lines, vector<P>& pt)
{
	for(int i=0; i<1000; i++) 
		node[i].clear();
		
	bool itr[50][1000]={0};
	for(int i=0; i<pt.size(); i++)
	for(int j=0; j<Lines.size(); j++)
		if(intersectLP(Lines[j], pt[i])) itr[j][i]=1;
	
	for(int i=0; i<pt.size(); i++)
	for(int j=0; j<Lines.size(); j++)
	{
		if(!itr[j][i]) continue;
		
		for(int k=i+1; k<pt.size(); k++) //i:src j:road k:dst
		{
			if(!itr[j][k]) continue;
			
			int t=0,ts=0;
			for(int l=0; l<N; l++)
			{
				if(intersectSP(L(pt[i], pt[k]), pt[l]))
				{
					t|=(1<<l);
					ts++;
				}
			}
			if(ts<=1) continue;
			node[i].push_back(Edge(k, j, dist(pt[i], pt[k]), t));
			node[k].push_back(Edge(i, j, dist(pt[i], pt[k]), t));
		}
	}
}

void Dijkstra()
{
	memset(v,0,sizeof(v));
	priority_queue<Trl> q;
	
	for(int i=0; i<N; i++)
		q.push(Trl(i,49,-1,0,0));
		
	while(1)
	{
		Trl t=q.top(); q.pop();
		
		if(v[t.h][t.p]) continue;
		v[t.h][t.p]=1;
		
		if(t.h==(1<<N)-1)
		{
			printf("%d %.8f\n", t.t, t.c);
			return;
		}
		
		for(int i=0; i<node[t.p].size(); i++)
		{
			Edge e=node[t.p][i];
			if(e.l==t.l) continue;
			int th=t.h|e.pt;
			
			if(v[th][e.to]) continue;
			q.push(Trl(e.to, e.l, t.t+1, th, t.c+e.c));
		}
	}
}


int main()
{
	while(scanf("%d", &N), N)
	{
		vector<P> pt;
		for(int i=0; i<N; i++)
		{
			int x,y;
			scanf("%d%d", &x, &y);
			pt.push_back(P(x,y));
		}
		
		vector<L> Lines;
		bool cont[1<<10]={0};
		for(int i=0; i<N; i++)
		for(int j=i+1; j<N; j++)
		{
			int h=0;
			L l=L(pt[i], pt[j]);
			for(int k=0; k<N; k++)
				if(intersectLP(l, pt[k])) h|=(1<<k);
			
			if(cont[h]) continue;
			cont[h]=1;
			Lines.push_back(l);
		}
		
		for(int i=0; i<Lines.size(); i++)
		for(int j=i+1; j<Lines.size(); j++)
		{
			if(intersectLL(Lines[i], Lines[j]))
			{
				P x=crosspoint(Lines[i], Lines[j]);
				bool g=true;
				for(int k=0; k<pt.size(); k++)
				{
					if(isequal(pt[k], x))
					{
						g=false;
						break;
					}
				}
				
				if(g) pt.push_back(x);
			}
		}
		
		MakeGraph(Lines, pt);
		Dijkstra();
	}
}