#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
using namespace std;
using ll = long long;


unsigned euclidean_gcd(unsigned a, unsigned b) {
    if (a < b) return euclidean_gcd(b, a);
    unsigned r;
    while ((r = a % b)) {
        a = b;
        b = r;
    }
    return b;
}

class UnionFind {
public:
    vector <ll> par;
    vector <ll> siz;
    UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    void init(ll sz_) {
        par.resize(sz_);
        siz.assign(sz_, 1LL);
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    ll root(ll x) {
        while (par[x] != x) {
            x = par[x] = par[par[x]];
        }
        return x;
    }
    bool merge(ll x, ll y) {
        x = root(x);
        y = root(y);
        if (x == y) return false;
        if (siz[x] < siz[y]) swap(x, y);
        siz[x] += siz[y];
        par[y] = x;
        return true;
    }

    bool issame(ll x, ll y) {
        return root(x) == root(y);
    }

    ll size(ll x) {
        return siz[root(x)];
    }
};

long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

long long modinv(long long a, long long mod) {
    return modpow(a, mod - 2, mod);
}

int main() {
    ll n;
    cin >> n;
    vector<pair<ll,ll>> z(n);
    for (int i = 0; i < n; i++) {
        cin >> z[i].first >> z[i].second;
    }
    double ans = 0;
    if (n >= 3) {
        for (int i = 0; i < n; i++) {
            for (int j = i + 1; j < n; j++) {
                for (int k = j + 1; k < n; k++) {
                    double a = 1.0*z[i].first;
                    double b = 1.0 * z[i].second;
                    double c = 1.0 * z[j].first;
                    double d = 1.0 * z[j].second;
                    double e = 1.0 * z[k].first;
                    double f = 1.0 * z[k].second;
                    double aa = sqrt(1.0 * (a - c) * (a - c) + 1.0 * (b - d) * (b - d));
                    double bb = sqrt(1.0 * (a - e) * (a - e) + 1.0 * (b - f) * (b - f));
                    double cc = sqrt(1.0 * (e - c) * (e - c) + 1.0 * (f - d) * (f - d));
                    double zans = aa * bb * cc / sqrt((aa + bb + cc) * (aa - bb + cc) * (bb - aa + cc) * (aa + bb - cc));
                    double g = max(aa,max(bb,cc));
                    if (aa * aa > bb * bb + cc * cc || bb * bb > aa * aa + cc * cc || cc * cc > bb * bb + aa * aa)zans = g / 2.0;
                    ans = max(ans, zans);
                }
            }
        }
    }
    else {
        ll i = 0;
        ll j = 1;
        double a = 1.0 * z[i].first;
        double b = 1.0 * z[i].second;
        double c = 1.0 * z[j].first;
        double d = 1.0 * z[j].second;
        ans = sqrt(1.0 * (a - c) * (a - c) + 1.0 * (b - d) * (b - d))/2.0;
    }
    cout << fixed << setprecision(15) << ans << endl;
}

Measured memory_bytes: 384