#include<iostream>
#include <bits/stdc++.h>

#define ld long double
#define ll long long
#define rep(i, a, b) for(int i = a ; i < b ; i ++)
#define sz(v) (int)v.size()
#define all(v) begin(v), end(v)
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int N = 2e3 + 5;
int y[N], x1[N], x2[N];
int n;

ll solve(int x, int h) {
    vector<pair<pair<ld, ld>, int> > res;
    for (int i = 0; i < n; i++) {
        if (y[i] == h)continue;
        ld dy = y[i] - h;
        ld dx1 = x1[i] - x, dx2 = x2[i] - x;
        // dx1 / dy
        ld l = -h * dx1 / dy;
        ld r = -h * dx2 / dy;
        if (l > r)swap(l, r);
        res.push_back({{l, r}, abs(x1[i] - x2[i])});
    }
    sort(res.begin(), res.end());
    ll ans = 0, sum = 0;
    priority_queue<pair<ld, int> > q;
    for (auto i: res) {
        sum += i.second;
        while (!q.empty() && -q.top().first < i.first.first) {
            sum -= q.top().second;
            q.pop();
        }
        q.push({-i.first.second, i.second});
        ans = max(ans, sum);
    }
    return ans;
}

void doWork() {
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> x1[i] >> x2[i] >> y[i];
    }
    ll ans = 0;
    for (int i = 0; i < n; i++) {
        ans = max(ans, abs(x1[i] - x2[i]) + solve(x1[i], y[i]));
        ans = max(ans, abs(x1[i] - x2[i]) + solve(x2[i], y[i]));
    }
    cout << ans;
    // dx / dy = s

    // y => y * s + c
    // y * s + c = X
    // ys + c >=l && ys + c <=r
    // s>= (l-c) / y  && s<= (r-c)/y

    // (l-c) / y <= s <= (r-c) / y
}

int main() {
    IO
    int t = 1;
//    cin >> t;
    for (int i = 1; i <= t; i++) {
        //  cout << "Case #" << i << ": ";
        doWork();
    }
}