#include <bits/stdc++.h>
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define st first
#define nd second
using namespace std;
typedef long long ll;
typedef long double ld;
const int mod = 1e9 + 7;
const int N = 1e6 + 5;

#define rep(i,a,b) for (int i = (a); i < (b); ++i)

template<class T> struct Point3D {
  typedef Point3D P;
  typedef const P& R;
  T x, y, z;
  explicit Point3D(T x=0, T y=0, T z=0) : x(x), y(y), z(z) {}
  bool operator<(R p) const {
    return tie(x, y, z) < tie(p.x, p.y, p.z); }
  bool operator==(R p) const {
    return tie(x, y, z) == tie(p.x, p.y, p.z); }
  P operator+(R p) const { return P(x+p.x, y+p.y, z+p.z); }
  P operator-(R p) const { return P(x-p.x, y-p.y, z-p.z); }
  P operator*(T d) const { return P(x*d, y*d, z*d); }
  P operator/(T d) const { return P(x/d, y/d, z/d); }
  T dot(R p) const { return x*p.x + y*p.y + z*p.z; }
  P cross(R p) const {
    return P(y*p.z - z*p.y, z*p.x - x*p.z, x*p.y - y*p.x);
  }
  T dist2() const { return x*x + y*y + z*z; }
  ld dist() const { return sqrt((ld)dist2()); }
  //Azimuthal angle (longitude) to x-axis in interval [-pi, pi]
  ld phi() const { return atan2(y, x); }
  //Zenith angle (latitude) to the z-axis in interval [0, pi]
  ld theta() const { return atan2(sqrt(x*x+y*y),z); }
  P unit() const { return *this/(T)dist(); } //makes dist()=1
  //returns unit vector normal to *this and p
  P normal(P p) const { return cross(p).unit(); }
  //returns point rotated 'angle' radians ccw around axis
  P rotate(ld angle, P axis) const {
    ld s = sin(angle), c = cos(angle); P u = axis.unit();
    return u*dot(u)*(1-c) + (*this)*c - cross(u)*s;
  }
};

typedef Point3D<ll> P3;

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	int n; cin >> n;
	if (n <= 3) {
		cout << "0.0\n";
		return 0;
	}
	vector<P3> a(n);
	for (int i = 0; i < n; i++)
		cin >> a[i].x >> a[i].y >> a[i].z;
	ld ans = 1e18;
	for (int i = 0; i < n; i++) {
		for (int j = i + 1; j < n; j++) {
			for (int k = j + 1; k < n; k++) {
				P3 dir = (a[j] - a[i]).cross(a[k] - a[i]);
				int x = 0, y = 0;
				ld cur = 0, len = sqrt(dir.x * dir.x + dir.y * dir.y + dir.z * dir.z);
				for (int l = 0; l < n; l++) {
					ll val = dir.dot(a[l] - a[i]);
					x += val < 0;
					y += val > 0;
					cur = max(cur, (ld)abs(val) / len);
				}
				if (x > 0 && y > 0)
					continue;
				ans = min(ans, cur);
			}
		}
	}
	cout << fixed << setprecision(15) << ans << "\n";
}