#line 2 "header.hpp"

//%snippet.set('header')%
//%snippet.fold()%
#ifndef HEADER_H
#define HEADER_H

// template version 2.0
using namespace std;
#include <bits/stdc++.h>

// varibable settings
const long long INF = 1e18;
template <class T> constexpr T inf = numeric_limits<T>::max() / 2.1;

#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (ll i = (ll)((b)-1); i >= (ll)(a); --i)
#define r_rep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define mt(...) make_tuple(__VA_ARGS__)
#define ub upper_bound
#define lb lower_bound
#define lpos(A, x) (lower_bound(all(A), x) - A.begin())
#define upos(A, x) (upper_bound(all(A), x) - A.begin())
template <class T> inline void chmax(T &a, const T &b) { if ((a) < (b)) (a) = (b); }
template <class T> inline void chmin(T &a, const T &b) { if ((a) > (b)) (a) = (b); }
template <typename X, typename T> auto make_table(X x, T a) { return vector<T>(x, a); }
template <typename X, typename Y, typename Z, typename... Zs> auto make_table(X x, Y y, Z z, Zs... zs) { auto cont = make_table(y, z, zs...); return vector<decltype(cont)>(x, cont); }

#define divceil(a, b) ((a) + (b)-1) / (b)
#define is_in(x, a, b) ((a) <= (x) && (x) < (b))
#define uni(x) sort(all(x)); x.erase(unique(all(x)), x.end())
#define slice(l, r) substr(l, r - l)

typedef long long ll;
typedef long double ld;

template <typename T>
using PQ = priority_queue<T, vector<T>, greater<T>>;
struct Fast { Fast() { std::cin.tie(0); ios::sync_with_stdio(false); } } fast;
void check_input() { assert(cin.eof() == 0); int tmp; cin >> tmp; assert(cin.eof() == 1); }

#if defined(PCM) || defined(LOCAL)
#else
#define dump(...) ;
#define dump_1d(...) ;
#define dump_2d(...) ;
#define cerrendl ;
#endif

#endif /* HEADER_H */
//%snippet.end()%
#line 2 "solve.cpp"
template<class T=ll> using vec = vector<T>;

ll n;

ld calc(ld x, ld y, ld p, ld q){
    return sqrt((x-p)*(x-p) + (y-q)*(y-q));
}

ld mirx(const vec<ll>& a, const vec<ll>& b, ld x){
    ld l = -1e9;
    ld r = 1e9;

    auto dist = [&](ld x, ld y){
        ld res = 0;
        rep(i, n){
            chmax(res, calc(x, y, a[i], b[i]));
        }
        return res;
    };

    ll num = 100;
    while(num--){
        ld d = (r-l)/3;
        ld ml = l + d;
        ld mr = l + 2*d;
        if ((dist(x, ml) < dist(x, mr))){
            r = mr;
        }
        else{
            l = ml;
        }
    }
    return dist(x, l);
}

ld mir(const vec<ll>& a, const vec<ll>& b){
    ld l = -1e9;
    ld r = 1e9;

    ll num = 100;
    while(num--){
        ld d = (r-l)/3;
        ld ml = l + d;
        ld mr = l + 2*d;
        if ((mirx(a, b, ml) < mirx(a, b, mr))){
            r = mr;
        }
        else{
            l = ml;
        }
    }
    return mirx(a, b, l);
}


int solve() {
    cin>>n;
    vec<ll> x(n), y(n);
    rep(i, n){
        cin>>x[i]>>y[i];
    }
    double ans = mir(x, y);
    printf("%.12f", ans);

    return 0; 
}


int main(){/*{{{*/
    solve();
    check_input();
    return 0;
}/*}}}*/


Measured memory_bytes: 256