#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("enroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,mmx,avx,abm,tune=native")
using namespace std;
const int N = 3e3 + 179;
int dist[N][N];
int xs[N];
int ys[N];
int n;
double ans;
vector<pair<int, int>> cords;
int b, c;
signed main() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> xs[i] >> ys[i];
    cords.push_back({xs[i], ys[i]});
  }
  for (int i = 0; i < cords.size(); i++) {
    xs[i] = cords[i].first;
    ys[i] = cords[i].second;
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < i; j++) {
      dist[i][j] = dist[j][i] =
          (xs[i] - xs[j]) * (xs[i] - xs[j]) + (ys[i] - ys[j]) * (ys[i] - ys[j]);
    }
  }
  int best = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < i; j++) {
      if (dist[i][j] > best) {
        for (int k = 0; k < j; k++) {
          b = dist[i][k], c = dist[j][k];
          if (b > c) {
            b = c;
          }
          if (best < b) best = b;
        }
        if (dist[i][j] < best) best = dist[i][j];
      }
    }
  }
  cout.precision(10);
  ans = sqrt(best);
  ans /= 2;
  cout << fixed << ans << endl;
  return 0;
}
