#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair

struct pt{
	ll x,y;

	pt():x(0),y(0){}
	pt(ll a,ll b):x(a),y(b){}
};

pt operator - (pt a,pt b){return pt(a.x-b.x,a.y-b.y);}
ll cross(pt a,pt b){return a.x*b.y-a.y*b.x;}
bool collinear(pt a,pt b,pt c){return cross(a-b,c-b)==0;}

int part(pt a){return a.y<0 || (a.y==0 && a.x<0);}
bool operator < (pt a,pt b){return mp(part(a),(ll)0)<mp(part(b),cross(a,b));}

pt Fix(pt a){
	if(part(a)==1)return pt(0,0)-a;
	return a;
}

const int N=2050;
pt A[N],B[N];
bool was[N];
int val[N];
int main(){
	int n;
	scanf("%i",&n);
	vector<pair<pt,int>> start;
	for(int i=1;i<=n;i++){
		int x0,x1,y;
		scanf("%i %i %i",&x0,&x1,&y);
		A[i]=pt(x0,y);
		B[i]=pt(x1,y);
		val[i]=abs(x1-x0);
		start.pb({A[i],val[i]});
		start.pb({B[i],val[i]});
	}
	ll ans=0;
	for(auto p:start){
		pt C=p.first;
		vector<pair<pt,int>> evs;
		ll cnt=p.second;
		for(int i=1;i<=n;i++){
			if(collinear(C,A[i],B[i]))continue;
			evs.pb({Fix(A[i]-C),i});
			evs.pb({Fix(B[i]-C),i});
		}
		sort(evs.begin(),evs.end());
		for(int i=0,j;i<evs.size();i=j){
			for(j=i;j<evs.size() && cross(evs[i].first,evs[j].first)==0;j++){
				if(!was[evs[j].second]){
					cnt+=val[evs[j].second];
				}
			}
			ans=max(ans,cnt);
			for(j=i;j<evs.size() && cross(evs[i].first,evs[j].first)==0;j++){
				if(was[evs[j].second]){
					cnt-=val[evs[j].second];
				}
				was[evs[j].second]^=1;
			}
		}
	}
	printf("%lld\n",ans);
	return 0;
}