Problem: During a voyage of the starship Hakodate-maru (see Problem A), researchers found strange synchronized movements of stars. Having heard these observations, Dr. Extreme proposed a theory of "super stars". Do not take this term as a description of actors or singers. It is a revolutionary theory in astronomy.

According to this theory, stars we are observing are not independent objects, but only small portions of larger objects called super stars. A super star is filled with invisible (or transparent) material, and only a number of points inside or on its surface shine. These points are observed as stars by us.

In order to verify this theory, Dr. Extreme wants to build motion equations of super stars and to compare the solutions of these equations with observed movements of stars. As the first step, he assumes that a super star is sphere-shaped, and has the smallest possible radius such that the sphere contains all given stars in or on it. This assumption makes it possible to estimate the volume of a super star, and thus its mass (the density of the invisible material is known).

You are asked to help Dr. Extreme by writing a program which, given the locations of a number of stars, finds the smallest sphere containing all of them in or on it. In this computation, you should ignore the sizes of stars. In other words, a star should be regarded as a point. You may assume the universe is a Euclidean space.



Input

The input consists of multiple data sets. Each data set is given in the following format.


n
x1 y1 z1
x2 y2 z2
...
xn yn zn


The first line of a data set contains an integer n, which is the number of points. It satisfies the condition 4 ≤ n ≤ 30.

The locations of n points are given by three-dimensional orthogonal coordinates: (xi, yi, zi) (i = 1,..., n). Three coordinates of a point appear in a line, separated by a space character.

Each value is given by a decimal fraction, and is between 0.0 and 100.0 (both ends inclusive). Points are at least 0.01 distant from each other.

The end of the input is indicated by a line containing a zero.

Output

For each data set, the radius ofthe smallest sphere containing all given points should be printed, each in a separate line. The printed values should have 5 digits after the decimal point. They may not have an error greater than 0.00001.

Example

Input

4
10.00000 10.00000 10.00000
20.00000 10.00000 10.00000
20.00000 20.00000 10.00000
10.00000 20.00000 10.00000
4
10.00000 10.00000 10.00000
10.00000 50.00000 50.00000
50.00000 10.00000 50.00000
50.00000 50.00000 10.00000
0


Output

7.07107
34.64102

Solution (in CPP):

Solution:
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

#define MAX_N	(30)
#define MAX_CAN	(10000)

#define DELTA	((double)1e-6)

/* typedef */

typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int,int> pii;
typedef pair<long,long> pll;
typedef long long ll;

struct can_t {
  double r, x, y, z;
};

struct pt_t {
  double x, y, z;
};

/* classes */

class LessCan {
public:
  bool operator()(const can_t& lc, const can_t& rc) const {
    return lc.r < rc.r;
  }
};

/* global variables */

static pt_t signs[] = {
  { 1, 1, 1}, { 1, 1, -1}, { 1, -1, 1}, { 1, -1, -1},
  {-1, 1, 1}, {-1, 1, -1}, {-1, -1, 1}, {-1, -1, -1}
};

static int n;
static pt_t pts[MAX_N];

static can_t candidate[MAX_CAN], new_candidate[MAX_CAN];

/* subroutines */

double max_r(double x, double y, double z) {
  double max_r2 = 0.0;

  for (int i = 0; i < n; i++) {
    pt_t& p = pts[i];
    double dx = x - p.x;
    double dy = y - p.y;
    double dz = z - p.z;
    double r2 = dx * dx + dy * dy + dz * dz;
    if (max_r2 < r2) max_r2 = r2;
  }

  return sqrt(max_r2);
}

double solve_by_partition() {
  candidate[0].x = 50.0;
  candidate[0].y = 50.0;
  candidate[0].z = 50.0;

  int count = 1;
  double size = 100.0;
  double min_sofar = 1e50;
  double root3 = sqrt(3.0);

  while (size > DELTA) {
    size /= 2;
    int k = 0;

    for (int i = 0; i < count; i++) {
      for (int d = 0; d < 8; d++) {
        can_t c = candidate[i];
        double sizeh = size / 2;
        c.x += signs[d].x * sizeh;
        c.y += signs[d].y * sizeh;
        c.z += signs[d].z * sizeh;
        c.r = max_r(c.x, c.y, c.z);
        if (min_sofar > c.r) min_sofar = c.r;
        if (c.r > min_sofar + sizeh * root3) continue;
        if (k >= MAX_CAN) break;

        new_candidate[k] = c;
        k++;
      }
      if (k >= MAX_CAN) break;
    }

    count = k;
    for (int i = 0; i < count; i++)
      candidate[i] = new_candidate[i];

    sort(candidate, candidate + count, LessCan());
  }

  return min_sofar;
}

/* main */

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

    for (int i = 0; i < n; i++) {
      cin >> pts[i].x >> pts[i].y >> pts[i].z;
    }

    printf("%.5lf\n", solve_by_partition());
  }
  
  return 0;
}