#include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define ll long long
#define dbg(v) cerr<<#v<<" = "<<v<<'\n'
#define vi vector<int>
#define vl vector <ll>
#define pii pair<int,int>
#define mp make_pair
#define db long double
#define pb push_back
#define all(s) s.begin(),s.end()
template < class T > ostream& operator<<(ostream& stream, const vector<T> v){ stream << "[ "; for (int i=0; i<(int)v.size(); i++) stream << v[i] << " "; stream << "]"; return stream;}
template < class T > T smin(T &a,T b) {if (a > b) a = b;return a;}
template < class T > T smax(T &a,T b) {if (a < b) a = b;return a;}
const db eps = 1e-10;
int main(void) {
map < int , ll > ox;
int n;
ll answer = 0;
cin>>n;
vector < pii > p(n);
vi cost(n);
int index = -1;
for (auto & it : p) {
++index;
cin>>it.fi>>it.se>>cost[index];
ox[it.fi] += cost[index];
}
ll cnt = 0,sum = 0;
for (auto it : ox) {
sum += it.se;
smax(answer,sum - cnt);
smin(cnt,sum);
}
vector < db > M;
for (int ind = 0;ind < n;++ind)
for (int i = ind + 1;i < n;++i)
if (p[i].fi != p[ind].fi)
M.pb(1.0 * (p[i].se - p[ind].se) / (p[i].fi - p[ind].fi));
random_shuffle(all(M));
for (auto m : M) {
vector < pair < db , int > > v;
for (int i = 0;i < n;++i)
v.pb(mp(p[i].se - m * p[i].fi,cost[i]));
ll cnt = 0,sum = 0;
sort(all(v));
for (int i = 0,j = 0;i < n;i = j) {
j = i;
while (j < n && abs(v[i].fi - v[j].fi) < eps)
sum += v[j].se,++j;
smax(answer,sum - cnt);
smin(cnt,sum);
}
}
cout << answer << '\n';
return 0;
}
