#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <math.h>
#include <assert.h>
#include <vector>

using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
static const double EPS = 1e-9;
static const double PI = acos(-1.0);

#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)
#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)
#define MEMSET(v, h) memset((v), h, sizeof(v))

#include <complex>

typedef complex<double> Point;

struct Line : public vector<Point> {
  Line() {;}
  Line(Point a, Point b) { push_back(a); push_back(b); }
};

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

inline double dot(const Point &a, const Point &b) {
  return real(conj(a) * b);
}

inline int ccw(Point a, Point b, Point c) {
  b -= a;
  c -= a;
  if (cross(b, c) > 0) { return 1; }
  if (cross(b, c) < 0) { return -1; }
  if (dot(b, c) < 0) { return 2; }
  if (norm(b) < norm(c)) { return -2; }
  return 0;
}

bool intersectSS(const Line &s, const Line &t) {
  return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&
    ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;
}

bool intersectSP(const Line &s, const Point &p) {
  return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < EPS;
}

Point crosspointSS(const Line &l, const Line &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) {
    assert(false);
    if (intersectSP(l, m[0])) { return m[0]; }
    if (intersectSP(l, m[1])) { return m[1]; }
    if (intersectSP(m, l[0])) { return l[0]; }
    if (intersectSP(m, l[1])) { return l[1]; }
    return m[0];
  }
  if (abs(A) < EPS) { assert(false); }
  return m[0] + B / A * (m[1] - m[0]);
}

int n;
Point p[100];
pair<int, double> memo1[1 << 10][10][10];
pair<int, double> memo2[10][10][10][10];


int OnLine(int used, const Line &l) {
  REP(i, n) {
    if ((used >> i) & 1) { continue; }
    if (intersectSP(l, p[i])) { used |= 1 << i; }
  }
  return used;
}

pair<int, double> NextState(int from, int to, int nfrom, int nto) {
  if (memo2[from][to][nfrom][nto].first != -1) { return memo2[from][to][nfrom][nto]; }
  pair<int, double> ret(0, 0);
  Line pl = Line(p[to], p[to] + (p[to] - p[from]) * 1000.0);
  Line nl = Line(p[nfrom], p[nfrom] - (p[nto] - p[nfrom]) * 1000.0);
  double A = cross(pl[1] - pl[0], nl[1] - nl[0]);
  if (abs(A) < EPS || !intersectSS(pl, nl)) {
    ret.first = -2;
  } else {
    Point cp = crosspointSS(pl, nl);
    pl = Line(p[to], cp);
    nl = Line(cp, p[nto]);
    int nused = (1 << from) | (1 << to) | (1 << nfrom) | (1 << nto);
    double ndist = abs(p[to] - cp) + abs(cp - p[nto]);
    nused = OnLine(nused, pl);
    nused = OnLine(nused, nl);

    ret.first = nused;
    ret.second = ndist;
  }
  return memo2[from][to][nfrom][nto] = ret;
}

pair<int, double> calc(int used, int from, int to) {
  if (memo1[used][from][to].first != -1) { return memo1[used][from][to]; }
  if ((used | (1 << to)) == (1 << n) - 1) {
    return make_pair(0, 0);
  }
  pair<int, double> ret(1000, 1e+10);
  REP(nto, n) {
    if (nto == from) { continue; }
    if ((used >> nto) & 1) { continue; }
    REP(nfrom, n) {
      if (nfrom == nto) { continue; }
      if (((used >> nfrom) & 1) && nfrom != to) { continue; }
      pair<int, double> nstate = NextState(from, to, nfrom, nto);
      if (nstate.first == -2) { continue; }

      int nused = used | nstate.first;
      double ndist = nstate.second;
      pair<int, double> nret = calc(nused, nfrom, nto);
      nret.first++;
      nret.second += ndist;
      ret = min(ret, nret);
    }
  }
  return memo1[used][from][to] = ret;
}

int main() {
  while (scanf("%d", &n), n) {
    REP(i, n) {
      double x, y;
      scanf("%lf %lf", &x, &y);
      p[i] = Point(x, y);
    }
    pair<int, double> ans(1000, 1e+10);
    MEMSET(memo1, -1);
    MEMSET(memo2, -1);
    REP(i, n) {
      REP(j, n) {
        if (i == j) { continue; }
        int used = (1 << i) | (1 << j);
        used = OnLine(used, Line(p[i], p[j]));
        pair<int, double> nans = calc(used, i, j);
        nans.second += abs(p[i] - p[j]);
        ans = min(ans, nans);
      }
    }
    printf("%d %.8f\n", ans.first, ans.second);
  }
}

Measured memory_bytes: 2308