
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
struct node {
int s;
int a;
int e;
long long sum;
bool operator<(const node&x)const{
return sum<x.sum;
}
}stu[1010];
int n;
int main()
{
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%d %d %d", &stu[i].s, &stu[i].a, &stu[i].e);
stu[i].sum = stu[i].s + stu[i].a + stu[i].e;
}
sort(stu,stu+n);
LL sum=0;
LL ans=0;
LL t=0;
t = stu[0].s + stu[0].a;
sum = stu[0].sum;
ans=t;
for (int i = 1; i < n; i++)
{
t=sum+stu[i].s+stu[i].a;
ans+=t;
sum+=stu[i].sum;
}
printf("%lld\n", ans);
return 0;
}