/**
 *      Author:  Nicholas Winschel
 *      Created: 11.11.2024 23:38:24
**/

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using db=long double;
template<class T> using V=vector<T>;
using vi = V<int>;
using vl = V<ll>;
using pi = pair<int,int>;
#define f first
#define s second
#define sz(x) (int)((x).size())
#define each(a,b) for (auto &a : b)

ll bes = 8e18;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

const int MAXN = 1e5+5;

ll x[MAXN], y[MAXN], z[MAXN];

void tr(int i, int j) {
  bes = min(bes, (x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])+(z[i]-z[j])*(z[i]-z[j]));
}

int main() {
  cin.tie(0)->sync_with_stdio(0); // initialize fast I/O

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

  vi inds(n);
  iota(inds.begin(), inds.end(), 0);
  uniform_int_distribution<ll> rnd(-1e9, 1e9);

  for (int _ = 0; _ < 50; _++) {
    ll mx = rnd(rng), my = rnd(rng), mz = rnd(rng);
    sort(inds.begin(), inds.end(), [&](int i, int j) {
      return mx*x[i] + my*y[i] + mz*z[i] < mx*x[j] + my*y[j] + mz*z[j];
    });
    for (int i = 0; i+1 < n; i++)
      tr(inds[i], inds[i+1]);
  }

  cout << fixed << setprecision(15) << sqrtl(bes);


  return 0;
}