#include<bits/stdc++.h>
using namespace std;
#define _for(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define debug(a) cout<<#a<<a<<endl;
#define int long long
#define io_speed_up ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
typedef long long ll;
typedef unsigned long long u64;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define double long double
const int N=55;
const double eps=1e-9;
int sgn(double x){
    return x<-eps?-1:x>eps;
}
struct point3{
    double x,y,z;
}e[N];
point3 xmu(point3 u,point3 v){
    point3 ret;
    ret.x=u.y*v.z-v.y*u.z;
    ret.y=u.z*v.x-u.x*v.z;
    ret.z=u.x*v.y-u.y*v.x;
    return ret;
}
double dmu(point3 u,point3 v){
    return u.x*v.x+u.y*v.y+u.z*v.z;
}
point3 subt(point3 u,point3 v){
    point3 ret;
    ret.x=u.x-v.x;
    ret.y=u.y-v.y;
    ret.z=u.z-v.z;
    return ret;
}
double vlen(point3 p){
    return sqrt(p.x*p.x+p.y*p.y+p.z*p.z);
}
point3 pvec(point3 s1,point3 s2,point3 s3){
    return xmu(subt(s1,s2),subt(s2,s3));
}
int dot_inline(point3 p1,point3 p2,point3 p3){
    return vlen(xmu(subt(p1,p2),subt(p2,p3)))<eps;
}
int dot_onplane(point3 a,point3 b,point3 c,point3 d){
    return sgn(dmu(pvec(a,b,c),subt(d,a)));
}
int parallel(point3 u1,point3 v1,point3 u2,point3 v2){
    return vlen(xmu(subt(u1,v1),subt(u2,v2)))<eps;
}
void solve(){
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        double x,y,z;
        cin>>x>>y>>z;
        e[i].x=x;
        e[i].y=y;
        e[i].z=z;
    }
    double ans=0x3f3f3f3f3f3f*1.0;
    
    for(int i=1;i<=n;i++){
        for(int j=i+1;j<=n;j++){
            for(int k=j+1;k<=n;k++){
                if(dot_inline(e[i],e[j],e[k])) continue;
                else{   
                    double inf=0x3f3f3f3f3f3f*1.0;
                    double maxx=0;
                    double dis=maxx-inf;
                    //cout<<i<<" "<<j<<" "<<k<<endl;
                    point3 ret=pvec(e[i],e[j],e[k]);
                    for(int p=1;p<=n;p++){
                        double temp=dmu(ret,e[p])/vlen(ret);
                        if(sgn(dmu(ret,e[p]))==0) temp=0;
                        inf=min(inf,temp);
                        maxx=max(maxx,temp);
                        dis=maxx-inf;
                    }
                    // cout<<i<<" "<<j<<" "<<k<<" "<<endl;
                    // cout<<dis<<endl;
                    ans=min(ans,dis);
                }
            }
        }
    }
    for(int u1=1;u1<=n;u1++){
        for(int v1=u1+1;v1<=n;v1++){
            for(int u2=1;u2!=u1&&u2!=v1&&u2<=n;u2++){
                for(int v2=u2+1;v2!=u1&&v2!=v1&&v2<=n;v2++){
                    int flag=parallel(e[u1],e[v1],e[u2],e[v2]);
                    int flag2=dot_onplane(e[u1],e[u2],e[v1],e[v2]);
                    if(flag==1||flag2==0) continue;
                    else{
                        double inf=0x3f3f3f3f3f3f*1.0;
                        double maxx=0;
                        double dis=maxx-inf;
                        point3 u3=subt(e[u1],subt(e[v2],e[u2]));
                        point3 ret=pvec(e[u1],e[v1],u3);
                        for(int p=1;p<=n;p++){
                            double temp=dmu(ret,e[p])/vlen(ret);
                            if(sgn(dmu(ret,e[p]))==0) temp=0;
                            inf=min(inf,temp);
                            maxx=max(maxx,temp);
                            dis=maxx-inf;
                        }
                        // cout<<u1<<" "<<v1<<" "<<u2<<" "<<v2<<" "<<"sige"<<endl;
                        // cout<<dis<<endl;
                        ans=min(ans,dis);
                    }
                }
            }
        }
    }
    if(sgn(ans-0x3f3f3f3f3f3f*1.0)==0) {
        double temp=0;
        cout<<fixed<<setprecision(15)<<temp<<endl;
        return ;
    }
    cout<<fixed<<setprecision(15)<<ans<<endl;
}
signed main(){
    io_speed_up;
    solve();
    return 0;
}
/*
8
1 1 1
1 1 2
1 2 1
1 2 2
2 1 1
2 1 2
2 2 1
2 2 2
5
1 1 1
1 2 1
1 1 2
1 2 2
2 1 1
8
2 2 2
12 12 2
2 7 3
12 8 3
7 2 3
7 12 3 
2 12 4 
12 2 4

5
1 4 5
2 7 9
6 1 1
4 3 2
10 10 10
*/