#include <iostream>
#include <iomanip>
#include <complex>
#include <vector>
#include <algorithm>
#include <cmath>
#include <array>
#include <map>
#include <set>
#include <utility>
#include <queue>
using namespace std;
const double EPS = 1e-10;
const double INF = 1e12;
const double PI = acos(-1);
#define EQ(n,m) (abs((n)-(m)) < EPS)
#define X real()
#define Y imag()

typedef complex<double> P;
typedef vector<P> VP;
struct L : array<P, 2>{
    L(const P& a, const P& b){ at(0)=a; at(1)=b; }
    L(){}
};

namespace std{
    bool operator < (const P& a, const P& b){
        return !EQ(a.X,b.X) ? a.X<b.X : a.Y+EPS<b.Y;
    }
    bool operator == (const P& a, const P& b){
        return abs(a-b) < EPS;
    }
}

double dot(P a, P b){
    return (conj(a)*b).X;
}
double cross(P a, P b){
    return (conj(a)*b).Y;
}
int ccw(P a, P b, P c){
    b -= a;
    c -= a;
    if(cross(b,c) > EPS) return +1; //ccw
    if(cross(b,c) < -EPS) return -1; //cw
    if(dot(b,c) < -EPS) return +2; //c-a-b
    if(abs(c)-abs(b) > EPS) return -2; //a-b-c
    return 0; //a-c-b
}

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(cross(s[0]-p, s[1]-p))<EPS  && dot(s[0]-p, s[1]-p)<EPS;
}
bool isParallel(const P &a, const P &b){
    return abs(cross(a,b)) < EPS;
}
bool isParallel(const L &a, const L &b){
    return isParallel(a[1]-a[0], b[1]-b[0]);
}

P crosspointLL(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]);
  return m[0] + B/A *(m[1]-m[0]);
}

struct info{
    int pos,bit,turn;
    double dist;
    info(int p, int b, int t, double d):pos(p),bit(b),turn(t),dist(d){}
    info(){}
    bool operator <(const info &a) const{
        return (turn!=a.turn)? turn>a.turn: dist>a.dist;
    }
};
bool eqpos(const info &a, const info &b){
    return a.pos == b.pos;
}
pair<vector<vector<info> >, VP> exarrangement(const vector<L> &l, const VP &p, const set<P> &ps){
    vector<VP> cp(l.size());
    VP plist = p;
    for(int i=0; i<(int)l.size(); i++){
        for(int j=i+1; j<(int)l.size(); j++){
            if(!isParallel(l[i], l[j])){
                P cpij = crosspointLL(l[i], l[j]);
                cp[i].push_back(cpij);
                cp[j].push_back(cpij);
                plist.push_back(cpij);
            }
        }
        for(int j=0; j<(int)p.size(); j++){
            if(intersectLP(l[i], p[j])){
                cp[i].push_back(p[j]);
            }
        }
        sort(cp[i].begin(), cp[i].end());
        cp[i].erase(unique(cp[i].begin(), cp[i].end()), cp[i].end());
    }
    sort(plist.begin(), plist.end());
    plist.erase(unique(plist.begin(), plist.end()), plist.end());

    int n = plist.size();
    map<P, int> conv;
    for(int i=0; i<n; i++){
        conv[plist[i]] = i;
    }
    vector<vector<info> > adj(n);
    for(int i=0; i<(int)cp.size(); i++){
        for(int j=0; j<(int)cp[i].size(); j++){
            for(int k=j+1; k<(int)cp[i].size(); k++){
                int jidx = conv[cp[i][j]];
                int kidx = conv[cp[i][k]];
                double dist = abs(cp[i][j] -cp[i][k]);
                int bit = 0;
                L edge(cp[i][j], cp[i][k]);
                for(int t=0; t<(int)p.size(); t++){
                    if(intersectSP(edge, p[t])){
                        bit |= 1<<t;
                    }
                }
                adj[jidx].push_back(info(kidx, bit, 0, dist));
                adj[kidx].push_back(info(jidx, bit, 0, dist));
            }
        }
    }
    for(int i=0; i<n; i++){
        sort(adj[i].begin(), adj[i].end());
        adj[i].erase(unique(adj[i].begin(), adj[i].end(), eqpos), adj[i].end());
    }
    return make_pair(adj, plist);
}

pair<vector<vector<info> >, VP> makegraph(const VP &p){
    vector<L> lines;
    for(int i=0; i<(int)p.size(); i++){
        for(int j=i+1; j<(int)p.size(); j++){
            lines.push_back(L(p[i], p[j]));
        }
    }
    set<P> ps;
    for(int i=0; i<(int)p.size(); i++){
        ps.insert(p[i]);
    }
    return exarrangement(lines, p, ps);
}

int main(){
    while(1){
        int n;
        cin >> n;
        if(n==0) break;

        VP p(n);
        for(int i=0; i<n; i++){
            int x,y;
            cin >> x >> y;
            p[i] = P(x, y);
        }
        
        pair<vector<vector<info> >, VP> ret = makegraph(p);
        vector<vector<info> > &adj = ret.first;
        VP &plist = ret.second;
        priority_queue<info> wait;
        vector<vector<pair<int, double> > > mincost(plist.size(), vector<pair<int, double> >(1<<n, make_pair(100, INF)));
        for(int i=0; i<n; i++){
            int pidx = lower_bound(plist.begin(), plist.end(), p[i]) -plist.begin();
            wait.push(info(pidx, 0, -1, 0));
            mincost[i][1<<i] = make_pair(-1, 0);
        }

        while(!wait.empty()){
            int pos = wait.top().pos;
            int bit = wait.top().bit;
            int turn = wait.top().turn;
            double dist = wait.top().dist;
            wait.pop();
            if(mincost[pos][bit] < make_pair(turn, dist)) continue;
            if(bit == (1<<n)-1) continue;

            for(info &next: adj[pos]){
                int npos = next.pos;
                int nbit = bit | next.bit;
                double ndist = dist +next.dist;
                pair<int, double> cost(turn+1, ndist);
                if(cost < mincost[npos][nbit]){
                    wait.push(info(npos, nbit, turn+1, ndist));
                    mincost[npos][nbit] = cost;
                }
            }
        }

        pair<int, double> ans(100, INF);
        for(int i=0; i<(int)plist.size(); i++){
            ans = min(ans, mincost[i][(1<<n)-1]);
        }
        cout << fixed << setprecision(10);
        cout << ans.first << " " << ans.second << endl;
    }
    return 0;
}


Measured memory_bytes: 33000