#include<bits/stdc++.h>

using namespace std;

#define Fopen freopen("_in.txt","r",stdin); freopen("_out.txt","w",stdout);

#define LL long long

#define ULL unsigned LL

#define fi first

#define se second

#define pb push_back

#define lson l,m,rt<<1

#define rson m+1,r,rt<<1|1

#define lch(x) tr[x].son[0]

#define rch(x) tr[x].son[1]

#define max3(a,b,c) max(a,max(b,c))

#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;

const int inf = 0x3f3f3f3f;

const int _inf = 0xc0c0c0c0;

const LL INF = 0x3f3f3f3f3f3f3f3f;

const LL _INF = 0xc0c0c0c0c0c0c0c0;

const LL mod =  (int)1e9+;

const int N = 1e6 + ;

struct Node{

    int x, y;

    LL a;

    bool operator < (const Node & z) const{

        return x < z.x;

    }

}A[N];

LL f[N];

int q[N];

int main(){

    int n;

    scanf("%d", &n);

    for(int i = ; i <= n; ++i)

        scanf("%d%d%lld", &A[i].x, &A[i].y, &A[i].a);

    sort(A+, A++n);

    int L = , R = ;

    for(int i = ; i <= n; ++i){

        while(L < R && f[q[L+]]-f[q[L]]>= 1ll*A[i].y * ((A[q[L+]].x - A[q[L]].x))) ++L;

        f[i] = f[q[L]] + (1ll*A[i].x-A[q[L]].x)*A[i].y - A[i].a;

        while(L < R && ((long double)f[q[R]]-f[q[R-]]) * (A[i].x - A[q[R]].x) <= ((long double)f[i]-f[q[R]])  * ((A[q[R]].x - A[q[R-]].x))) --R;

        q[++R] = i;

    }

    LL ans = ;

    for(int i = ; i <= n; ++i) ans = max(ans, f[i]);

    cout << ans << endl;

    return ;

}