#include <bits/stdc++.h>
using namespace std;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define v vector
#define mp make_pair
typedef long long ll;
typedef pair<int, int > pii;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }
void io() {
#ifdef LOCAL_PROJECT
freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else
#endif
ios_base::sync_with_stdio(false); cin.tie(NULL);
}
/****************************************************************/
const int MAXN = 2000;
int N, pos[2000];
ll x[2000], y[2000], w[2000];
struct Node {
ll lsum, rsum, bsum, esum;
Node() {
lsum = rsum = bsum = esum = 0LL;
}
Node(ll val) {
lsum = rsum = bsum = max(0LL, val);
esum = val;
}
Node(Node &a, Node &b) {
lsum = max(a.lsum, a.esum + b.lsum);
rsum = max(b.rsum, b.esum + a.rsum);
bsum = max(a.bsum, max(b.bsum, a.rsum + b.lsum));
esum = a.esum + b.esum;
}
};
struct Seg {
int SZ = 1 << 12;
Node data[1 << 13];
void set(int x, ll val) {
data[x + SZ] = Node(val);
}
void build() {
for (int i = SZ - 1; i > 0; i--)
data[i] = Node(data[i * 2], data[i * 2 + 1]);
}
void update(int x, ll val) {
set(x, val);
x += SZ;
x /= 2;
while (x) {
data[x] = Node(data[x * 2], data[x * 2 + 1]);
x /= 2;
}
}
ll query() {
return data[1].bsum;
}
//int data[2000];
//void set(int x, int val) {
// data[x] = val;
//}
//void build() {
//}
//void update(int x, int val) {
// data[x] = val;
//}
//ll query() {
// // cout << "Query: ";
// // FOR(i, 0, N) cout << data[i] << " ";
// ll best = 0;
// FOR(i, 0, N) FOR(j, i, N) {
// ll tmp = 0;
// FORE(x, i, j) tmp += data[x];
// maxx(best, tmp);
// }
// // cout << ":: " << best << "\n";
// return best;
//}
} tree;
struct upd {
ll vx, vy;
int ia, ib;
upd(ll _vx, ll _vy, int _a, int _b) : vx(_vx), vy(_vy), ia(_a), ib(_b) {}
};
v<upd> lines;
void perform_swap(int i, int j) {
// cout << "Swapping " << i << " " << j << "\n";
swap(pos[i], pos[j]);
tree.update(pos[i], w[i]);
tree.update(pos[j], w[j]);
}
void setup() {
cin >> N;
v<int> pnts(N);
FOR(i, 0, N) {
cin >> x[i] >> y[i] >> w[i];
pnts[i] = i;
}
sort(all(pnts), [](int &i, int &j) {
return mp(x[i], y[i]) < mp(x[j], y[j]);
});
FOR(i, 0, N) {
pos[pnts[i]] = i;
tree.update(i, w[pnts[i]]);
}
}
int main() {
io();
setup();
FOR(i, 0, N) FOR(j, 0, N) if (x[i] < x[j])
lines.push_back(upd(x[j] - x[i], y[j] - y[i], i, j));
sort(all(lines), [](upd &a, upd &b) {
if (a.vy*b.vx == b.vy*a.vx) {
// assert(0);
return mp(x[a.ia], x[a.ib]) > mp(x[b.ia], x[b.ib]);
}
return a.vy*b.vx > b.vy*a.vx;
});
reverse(all(lines));
ll best = tree.query();
for (int i = 0; i < lines.size(); ) {
ll curx = lines[i].vx, cury = lines[i].vy;
while (i < lines.size() && cury*lines[i].vx == curx*lines[i].vy) {
perform_swap(lines[i].ia, lines[i].ib);
i++;
}
maxx(best, tree.query());
}
cout << best << "\n";
}
