#ifndef DEBUG
#  define NDEBUG
#endif
#include <iostream>
#include <string>
#include <iterator>
#include <utility>
#include <type_traits>
#include <limits>
#include <cassert>
#include <vector>
#include <cmath>
#include <iomanip>

using namespace std;

// template {{{
// misc {{{
using Z = long long;
[[maybe_unused]]
constexpr Z INF = numeric_limits<Z>::max() / 3;
// }}}

// debug {{{
template <class T>
using enable_if_sequence_t = enable_if_t<
  is_same<
    typename iterator_traits<
      typename remove_cv_t<remove_reference_t<T>>::iterator
    >::iterator_category,
    random_access_iterator_tag>{}>;
#ifdef NDEBUG
# define dump(x)
# define debug if (0)
template <class T>
inline T&& ix(T&& value) { return value; }
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix(T&& container, Index index, Indices... indices) {
  return ix(container[index], indices...);
}
#else
# define dump(x) do { \
    cerr << "\e[33m[dump: " << __LINE__ << "] " << (#x) << " = " << x << "\e[0m" << endl; \
  } while (0);
# define debug
template <class T>
inline auto&& ix_impl([[maybe_unused]] int line, [[maybe_unused]] const char* code, T&& value) {
  return value;
}
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix_impl(int line, const char* code, T&& container, Index index, Indices... indices) {
  if (index < 0) {
    cerr << "\e[31mix: negative index at line " << line << ", ix(" << code << ")\e[0m" << endl;
    exit(1);
  }
  int size = container.size();
  if (index >= size) {
    cerr << "\e[31mix: index out of range at line " << line << ", ix(" << code << ")\n"
      << "index = " << index << " whereas size = " << size << "\e[0m" << endl;
    exit(1);
  }
  return ix_impl(line, code, container[index], indices...);
}
#define ix(...) ix_impl(__LINE__, #__VA_ARGS__, __VA_ARGS__)
#endif
// }}}

// IO {{{
template <class T, class U>
ostream& operator<< (ostream& os, pair<T, U> p) {
  os << '(' << p.first << ", " << p.second << ')';
  return os;
}
template <class T>
false_type is_container_impl(...);
template <class T, class = typename T::iterator>
true_type is_container_impl(T);
template <class T>
struct is_container : decltype(is_container_impl<T>(declval<T>())) {};
template <>
struct is_container <string> : std::false_type {};
template <class Container, class = enable_if_t<is_container<Container>{}>>
istream& operator>> (istream& is, Container& cont) {
  for (auto& v : cont) is >> v;
  return is;
}
template <class Container, class = enable_if_t<is_container<Container>{}>>
ostream& operator<< (ostream& os, Container const& cont) {
  bool first = true;
  constexpr char sep =
    is_container<typename Container::value_type>{} ? '\n' : ' ';
  for (auto const& v : cont) {
    if (!first) {
      os << sep;
    }
    first = false;
    os << v;
  }
  return os;
}
// }}}
// }}}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  Z N;
  cin >> N;
  vector<double> xs(N), ys(N);
  for (auto i = 0; i < N; i++)
    cin >> ix(xs, i) >> ix(ys, i);
  double l = 0, r = 20000;
  for (auto i = 0; i < 200; i++) {
    double radius = (l + r) / 2;
    vector<pair<double, double>> centers;
    for (auto i = 0; i < N; i++)
      centers.emplace_back(ix(xs, i), ix(ys, i));
    for (auto i = 0; i < N; i++) {
      for (auto j = i + 1; j < N; j++) {
        double dx = ix(xs, i) - ix(xs, j),
               dy = ix(ys, i) - ix(ys, j);
        double d = hypot(dx, dy);
        if (d > 2 * radius || d < radius) continue;
        double mx = ix(xs, j) + dx / 2,
               my = ix(ys, j) + dy / 2,
               t = sqrt(radius * radius - (d / 2) * (d / 2)),
               tx = -t * dy / d,
               ty = t * dx / d;
        centers.emplace_back(mx + tx, my + ty);
        centers.emplace_back(mx - tx, my - ty);
      }
    }
    debug {
      if (i >= 190) {
        dump(radius);
        dump(centers);
      }
    }
    bool ok = false;
    for (auto&& p : centers) {
      double max_d = 0;
      for (auto i = 0; i < N; i++)
        max_d = max(max_d, hypot(p.first - ix(xs, i), p.second - ix(ys, i)));
      if (max_d <= radius + 1e-7) {
        ok = true;
        break;
      }
    }
    (ok ? r : l) = radius;
  }
  cout << setprecision(10) << l << endl;
}



Measured memory_bytes: 384