#include <bits/stdc++.h>
using namespace std;
#define pb push_back

using ll = long long;
using db = double;

const int maxn = 444;

int n;
int x[maxn], y[maxn], w[maxn];
ll cross(int i, int j, int k) {
    return 1ll * (x[j] - x[i]) * (y[k] - y[i]) - 1ll * (x[k] - x[i]) * (y[j] - y[i]);
}
ll dot(int i, int j, int k) {
    return 1ll * (x[j] - x[i]) * (x[k] - x[i]) + 1ll * (y[k] - y[i]) * (y[j] - y[i]);
}
db dis(int i, int j) {
    return sqrt(dot(i, j, j));
}
db geth(int i, int j, int k) {
    return cross(i, j, k) / dis(i, j);
}
struct segt {
    db lz[maxn << 2], mx[maxn << 2];
    void puttag(int i, db k) {
        lz[i] += k;
        mx[i] += k;
    }
    void pushdown(int i) {
        if (lz[i] == 0) return;
        puttag(i << 1, lz[i]);
        puttag(i << 1 | 1, lz[i]);
        lz[i] = 0;
    }
    void build(int i, int l, int r, const vector<db>& init) {
        lz[i] = 0;
        if (l == r) return mx[i] = -abs(init[l]), void();
        int mid = l + r >> 1;
        build(i << 1, l, mid, init);
        build(i << 1 | 1, mid + 1, r, init);
        mx[i] = max(mx[i << 1], mx[i << 1 | 1]);
    }
    void modify(int i, int l, int r, int x, int y, db k) {
        if (r < x || y < l || y < x) return;
        if (x <= l && r <= y) return puttag(i, k);
        int mid = l + r >> 1;
        pushdown(i);
        if (x <= mid) modify(i << 1, l, mid, x, y, k);
        if (y > mid) modify(i << 1 | 1, mid + 1, r, x, y, k);
        mx[i] = max(mx[i << 1], mx[i << 1 | 1]);
    }
    db query(int i, int l, int r, int x, int y) {
        if (r < x || y < l || y < x) return -1e18;
        if (x <= l && r <= y) return mx[i];
        int mid = l + r >> 1;
        pushdown(i);
        db ans = -1e18;
        if (x <= mid) ans = max(ans, query(i << 1, l, mid, x, y));
        if (y > mid) ans = max(ans, query(i << 1 | 1, mid + 1, r, x, y));
        return ans;
    }
} t1, t2;
db calc(int u, int v, vector<int> tmp) {
    static int id[maxn];
    assert(tmp.size() >= 2);
    db ans = w[u] + w[v] - 2 * dis(u, v);
    sort(tmp.begin(), tmp.end(), [&](int a, int b) {
        return dot(u, v, a) < dot(u, v, b);
    });
    for (int i = 0; i < tmp.size(); i++) {
        id[tmp[i]] = i;
    }
    int uid = id[u], vid = id[v];
    vector<db> init(tmp.size());
    for (int i = 0; i < tmp.size(); i++) {
        init[i] = 2 * dot(u, v, tmp[i]) / dis(u, v);
        // cerr << tmp[i] << " " << init[i] << "\n";
    }

    sort(tmp.begin(), tmp.end(), [&](int a, int b) {
        return cross(u, v, a) < cross(u, v, b);
    });
    t1.build(1, 0, uid, init);
    t2.build(1, vid, tmp.size() - 1, init);
    assert(uid < vid);
    db base = 0;
    for (int i = 0; i < tmp.size(); i++) {
        int lb = max(vid, id[tmp[i]]);
        int ub = min(uid, id[tmp[i]]);
        // cout<<"\n";
        // cout << lb << " " << ub << "\n";
        db l = t2.query(1, vid, tmp.size() - 1, lb, tmp.size() - 1);
        db r = t1.query(1, 0, uid, 0, ub);
        // cout << l << " " << r << "\n";
        // cout << base << " base\n";
        // cout << w[tmp[i]] << " " << geth(u, v, tmp[i]) * 2 << "\n";
        // cout<<l + r + base + w[tmp[i]] - geth(u, v, tmp[i]) * 2<<"\n";
        ans = max(ans, l + r + base + w[tmp[i]] - geth(u, v, tmp[i]) * 2);
        if (uid <= id[tmp[i]] && id[tmp[i]] <= vid) {
            base += w[tmp[i]];
        } else if (id[tmp[i]] < uid) {
            // cout<<"add "<<id[tmp[i]]<<" "<<tmp.size() - 1<<" by "<<w[tmp[i]]<<"\n";
            t1.modify(1, 0, uid, 0, id[tmp[i]], w[tmp[i]]);
        } else {
            t2.modify(1, vid, tmp.size() - 1, id[tmp[i]], tmp.size() - 1, w[tmp[i]]);
        }
    }
    // cerr << u << " " << v << " ans=" << ans << "\n";
    return ans;
}
void solve() {
    cin >> n;
    db ans = 0;
    for (int i = 1; i <= n; i++) {
        cin >> x[i] >> y[i] >> w[i];
        ans = max(ans, 1. * w[i]);
    }
    // calc(1,2, {1, 2, 3});
    // return;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (i == j) continue;
            vector<int> tmp;
            for (int k = 1; k <= n; k++) {
                if (cross(i, j, k) >= 0) tmp.push_back(k);
            }
            ans = max(calc(i, j, tmp), ans);
        }
    }
    cout << fixed << setprecision(20) << ans << "\n";
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--) solve();
    return 0;
}
/*

1-2-3-4-5
*/

/*
 5
 3 4 1
 2 1 1
 4 5 1
 3 2 1
 3
 2 2
 3 2
 1 2
*/