#pragma GCC optimize ("O3")
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
using namespace std;
typedef pair<int, int> P;
typedef pair<P, int> P2;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define index(xs, x) (int)(lower_bound(all(xs), x) - xs.begin())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007
struct Node {
long long s, l, r, m;
Node(long long s, long long l, long long r, long long m) : s(s), l(l), r(r), m(m) {}
Node(long long w) : Node(w, max(w, 0LL), max(w, 0LL), max(w, 0LL)) {}
Node() : Node(0) {}
};
Node op(const Node &a, const Node &b) {
return Node(
a.s + b.s,
max(a.l, a.s + b.l),
max(b.r, b.s + a.r),
max(max(a.m, b.m), a.r + b.l)
);
}
#define MAX_N (1<<11)
Node seg[MAX_N*2-1];
void update(int k, Node x) {
k += MAX_N-1;
seg[k] = x;
while (k > 0) {
k = (k-1)/2;
seg[k] = op(seg[k*2+1], seg[k*2+2]);
}
}
int N;
int X[2000], Y[2000], W[2000];
struct Rel {
int p, q;
Rel(int p, int q) : p(p), q(q) {
if (q < 0) p = -p, q = -q;
}
bool operator<(const Rel& b) const {
return 1LL*p*b.q < 1LL*b.p*q;
}
bool operator==(const Rel& b) const {
return 1LL*p*b.q == 1LL*b.p*q;
}
};
int pos[2000];
vector<P> ln[2000000];
vector<P> G[2000000];
signed main() {
ios::sync_with_stdio(false); cin.tie(0);
cin >> N;
vector<P2> ps;
rep(i, N) {
int x, y, w;
cin >> x >> y >> w;
ps.pb(P2(P(x, -y), w));
}
sort(all(ps));
rep(i, N) X[i] = ps[i]._1._1, Y[i] = -ps[i]._1._2, W[i] = ps[i]._2, pos[i] = i, update(i, Node(W[i]));
vector<Rel> lines;
rep(i, N) rep(j, i) {
Rel r = Rel(-1, 0);
if (X[i] != X[j]) r = Rel(Y[i]-Y[j], X[i]-X[j]);
lines.pb(r);
}
sort(all(lines)); uniq(lines);
rep(i, N) rep(j, i) {
Rel r = Rel(-1, 0);
if (X[i] != X[j]) r = Rel(Y[i]-Y[j], X[i]-X[j]);
ln[index(lines, r)].pb(P(i, j));
}
long long m = seg[0].m;
rep(e, lines.size()) {
vector<long long> bs;
const Rel &a = lines[e];
for (P p : ln[e]) bs.pb(1LL*Y[p._1]*a.q-1LL*X[p._1]*a.p);
sort(all(bs)); uniq(bs);
rep(i, bs.size()) G[i].clear();
for (P p : ln[e]) {
int k = index(bs, 1LL*Y[p._1]*a.q-1LL*X[p._1]*a.p);
G[k].pb(P(pos[p._1], p._1));
G[k].pb(P(pos[p._2], p._2));
}
rep(i, bs.size()) {
vector<P> &ps = G[i];
sort(all(ps)); uniq(ps);
rep(i, ps.size()/2) {
int a = ps[i]._2, b = ps[(int)ps.size()-1-i]._2;
swap(pos[a], pos[b]);
update(pos[a], Node(W[a]));
update(pos[b], Node(W[b]));
}
}
m = max(m, seg[0].m);
}
cout << m << "\n";
return 0;
}
