#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <complex>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
#include <limits>
#include <time.h>
#include <cstdint>
using namespace std;
using pii  = pair<int,int>;
using ll=long long;
using ld=long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define rep(i,n) for(ll i=0;i<(n);++i)
#define Rep(i,a,b) for(ll i=(a);i<(b);++i)
#define rrep(i,n) for(ll i=n-1;i>=0;i--)
#define rRep(i,a,b) for(ll i=a;i>=b;i--)
#define crep(i) for(char i='a';i<='z';++i)
#define psortsecond(A,N) sort(A,A+N,[](const pii &a, const pii &b){return a.second<b.second;});
#define ALL(x) (x).begin(),(x).end()
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define endl '\n'
int ctoi(const char c){
  if('0' <= c && c <= '9') return (c-'0');
  return -1;
}
ll gcd(ll a,ll b){return (b == 0 ? a : gcd(b, a%b));}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
constexpr ll MOD=1000000007;
constexpr ll INF=1000000011;
constexpr ll MOD2=998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS=10e-8;
template <class T, class U> inline bool chmax(T& lhs, const U& rhs) { if (lhs < rhs) { lhs = rhs; return 1; } return 0; }
template <class T, class U> inline bool chmin(T& lhs, const U& rhs) { if (lhs > rhs) { lhs = rhs; return 1; } return 0; }
template<typename T> istream& operator>>(istream& is,vector<T>& v){for(auto&& x:v)is >> x;return is;}
template<typename T,typename U> istream& operator>>(istream& is, pair<T,U>& p){ is >> p.first; is >> p.second; return is;}
template<typename T,typename U> ostream& operator>>(ostream& os, const pair<T,U>& p){ os << p.first << ' ' << p.second; return os;}
template<class T> ostream& operator<<(ostream& os, vector<T>& v){
  for(auto i=begin(v); i != end(v); ++i){
    if(i !=begin(v)) os << ' ';
    os << *i;
  }
  return os;
}

// modint

template <std::uint_fast64_t Modulus> class modint {
  using u64 = std::uint_fast64_t;

public:
  u64 a;

  constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
  constexpr u64 &value() noexcept { return a; }
  constexpr const u64 &value() const noexcept { return a; }
  constexpr modint operator+(const modint rhs) const noexcept {
    return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
    return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
    return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
    return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
    a += rhs.a;
    if (a >= Modulus) {
      a -= Modulus;
    }
    return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
    if (a < rhs.a) {
      a += Modulus;
    }
    a -= rhs.a;
    return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
    a = a * rhs.a % Modulus;
    return *this;
  }
  constexpr modint &operator/=(modint rhs) noexcept {
    u64 exp = Modulus - 2;
    while (exp) {
      if (exp % 2) {
        *this *= rhs;
      }
      rhs *= rhs;
      exp /= 2;
    }
    return *this;
  }
};

ll N,X[57],Y[57];

ld fanc(ld k){
  ld ma=0;
  rep(i,N){
    ma = max(ma,(X[i]-k)*(X[i]-k)+Y[i]*Y[i]);
  }
  return ma;
}

ld fanc1(ld x,ld y){
  ld ma=0;
  rep(i,N){
    ma = max(ma,(X[i]-x)*(X[i]-x)+(Y[i]-y)*(Y[i]-y));
  }
  return ma;
}

int main(){
  cin >> N;
  rep(i,N){
    cin >> X[i] >> Y[i];
  }
  ld x,y;
  ld high1=1000.0,low1=0.0;
  ld y1,y2;
  rep(i,500){
    ld mid_left1 = high1/3+low1*2/3;
    ld mid_right1 = high1*2/3+low1/3;

    ld high2=1000.0,low2=0.0;
    rep(i,500){
      ld mid_left2 = high2/3+low2*2/3;
      ld mid_right2 = high2*2/3+low2/3;
      if (fanc1(mid_left1,mid_left2) >= fanc1(mid_left1,mid_right2)){
        low2 = mid_left2;
      }
      else{
        high2 = mid_right2;
      }
    }
    y1=high2;

    high2=1000.0,low2=0.0;
    rep(i,500){
      ld mid_left2 = high2/3+low2*2/3;
      ld mid_right2 = high2*2/3+low2/3;
      if (fanc1(mid_right1,mid_left2) >= fanc1(mid_right1,mid_right2)){
        low2 = mid_left2;
      }
      else{
        high2 = mid_right2;
      }
    }
    y2=high2;

    if (fanc1(mid_left1,y1) >= fanc1(mid_right1,y2)){
      low1 = mid_left1;
    }
    else{
      high1 = mid_right1;
    }
  }
  x=high1;
  y=y1;
  ld ma=0;
  rep(i,N){
    ma=max(sqrt((x-X[i])*(x-X[i])+(y-Y[i])*(y-Y[i])),ma);
  }
  //cout << stpr(15) << x << " " << y << endl;
  cout << stpr(15) << ma << endl;
}

Measured memory_bytes: 3752