#include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>

using namespace std;

typedef long double ld;
typedef long long ll;

const int maxn = 2100;
const ld pi = acos(-1.0);

struct point{
    ld x,y;
    int dir; //-1 for left, 1 for right
    int id;
};

struct rec{
    ld angle;
    int id;
};

ld x0[maxn],x1[maxn],y[maxn];
point p[maxn << 1];
rec events[maxn << 1];

bool comp(const rec & a,const rec & b){
    return a.angle < b.angle;
}

int main(){
    int n;
    cin >> n;
    for (int i = 1;i <= n;i++){
        cin >> x0[i] >> x1[i] >> y[i];
        y[i] *= -1;
        if (x0[i] > x1[i]) swap(x0[i],x1[i]);
        p[2*i-1] = (point){x0[i], y[i], -1, i};
        p[2*i] = (point){x1[i], y[i], 1, i};
    }
    ll ret = 0;
    for (int i = 1;i <= 2*n;i++){
        int siz = 0;
        for (int j = 1;j <= 2*n;j++){
            if (j == i) continue;
            if (p[j].y == p[i].y) continue;
            ld angle = atan2(p[j].y - p[i].y, p[j].x - p[i].x);
            if (angle < 0) angle += pi;
            events[++siz] = (rec){angle, j};
        }
        sort(events+1,events+siz+1,comp);
        ld cur = x1[p[i].id] - x0[p[i].id];
        ret = max(ret, (ll)cur);
        for (int j = 1;j <= siz;j++){
          point pt = p[events[j].id];
          if ((pt.y > p[i].y && pt.dir == 1)
          || (pt.y < p[i].y && pt.dir == -1)){
              cur += x1[pt.id] - x0[pt.id];
          }
          if ((pt.y > p[i].y && pt.dir == -1) || (pt.y < p[i].y && pt.dir == 1)){
              cur -= x1[pt.id] - x0[pt.id];
          }
          ret = max(ret, (ll)cur);
        }
    }
    cout << ret << endl;
}