// 2008アジア地区予選J : Zigzag

#include <iostream>
#include <fstream>
#include <vector>
#include <complex>
#include <queue>
#include <cstring>

using namespace std;

const double EPS = 1e-8;

typedef complex<double> P;
struct L { P p, q; L(P p, P q) : p(p), q(q) {} };

class Node{
public:
	int b, p, q, num; double len;
	Node(int b, int p, int q, int num, double len) : b(b), p(p), q(q), num(num), len(len) {}
	bool operator < (const Node &nd) const {
		return make_pair(num, len) > make_pair(nd.num, nd.len);
	}
};

double dot(P a, P b) { return real(conj(a)*b); }
double cross(P a, P b) { return imag(conj(a)*b); }

P ssCrosspoint(L a, L b){
	double A = cross(a.q-a.p, b.q-b.p);
	double B = cross(a.q-a.p, a.q-b.p);
	return b.p + B/A * (b.q-b.p);
}

int main(){
	ifstream cin("J.in");
	int n;
	int bit[10][10];
	int num[1024][10][10];
	double len[1024][10][10];
	while(cin >> n, n){
		memset(num, -1, sizeof(num));
		priority_queue<Node> qu;
		vector<P> vp(n);
		for(int i=0;i<n;i++){
			double x, y; cin >> x >> y;
			vp[i] = P(x, y);
		}
		for(int i=0;i<n;i++){
			for(int j=i+1;j<n;j++){
				int b = (1<<i)|(1<<j);
				for(int k=0;k<n;k++)
					if(abs(abs(vp[i]-vp[k])+abs(vp[k]-vp[j])-abs(vp[i]-vp[j])) < EPS) b |= (1<<k);
				bit[i][j] = bit[j][i] = b;
				qu.push(Node(b, i, j, 0, abs(vp[i]-vp[j])));
				qu.push(Node(b, j, i, 0, abs(vp[i]-vp[j])));
			}
		}
		pair<int, double> res;
		while(!qu.empty()){
			Node nd = qu.top(); qu.pop();
			if(nd.b == (1<<n)-1){
				res = make_pair(nd.num, nd.len); break;
			} 
			if(num[nd.b][nd.p][nd.q]!=-1) continue;
			num[nd.b][nd.p][nd.q] = nd.num;
			len[nd.b][nd.p][nd.q] = nd.len;
			L l = L(vp[nd.p], vp[nd.q]);
			for(int i=0;i<n;i++){
				if(nd.b&(1<<i)) continue;
				for(int j=0;j<n;j++){
					if(i==j) continue;
					if(abs(imag((l.q-l.p)/(vp[i]-vp[j]))) < EPS) continue;
					P p = ssCrosspoint(l, L(vp[i], vp[j]));
					if(dot(l.q-p, l.p-p) < -EPS || dot(vp[i]-p, vp[j]-p) < -EPS) continue;
					if(abs(p-l.q)>abs(p-l.p)||abs(p-vp[j])>abs(p-vp[i])) continue;
					qu.push(Node(nd.b|bit[i][j], j, i, nd.num+1, nd.len+abs(p-l.q)+abs(p-vp[i])));
				}
			}
		}
		printf("%d %.8lf\n", res.first, res.second);
	}
}