#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,1,0,-1,1,1,-1,-1,0};
const ll dx[9]={1,0,-1,0,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int main(){
    ll w;cin >> w;
    vl a(52),b(52),c(52);
    rep(i,w)cin >> a[i] >> b[i] >> c[i];
    ll ans=0;
    {
        set<ll> st;st.insert(0);
        queue<ll> que;que.push(0);
        while(que.size()){
            ll v=que.front();que.pop();
            if(v>>25&1)continue;
            if(!(v&1)){
                ll x=v<<1;x|=1;
                if(!st.count(x)){
                    st.insert(x);
                    que.push(x);
                }
            }
            ll to=v<<1;
            if(st.count(to))continue;
            st.insert(to);
            que.push(to);
        }
        vpl res;
        for(auto bit:st){
            if(bit&1)continue;
            ll cost=0,fav=0;
            per(i,26){
                if(bit>>i&1){
                    fav+=b[i];
                    cost-=c[i];
                    i--;
                }
                else{
                    cost+=a[i];
                }
            }
            res.emplace_back((pl){cost,-fav});
        }
        sort(all(res));
        //cout << res.size() << endl;
        per(i,res.size()-1){
            chmin(res[i].second,res[i+1].second);
        }
        for(auto bit:st){
            if(bit&1)continue;
            ll cost=0,fav=0;
            per(i,26){
                if(bit>>i&1){
                    fav+=b[i+26];
                    cost-=c[i+26];
                    i--;
                }
                else{
                    cost+=a[i+26];
                }
            }
            auto itr=lower_bound(all(res),make_pair(-cost,-INF));
            if(itr==res.end())continue;
            chmax(ans,fav-itr->second);
        }
    }
    //cout << ans << endl;
    {
        set<ll> st;st.insert(0);
        queue<ll> que;que.push(0);
        while(que.size()){
            ll v=que.front();que.pop();
            if(v>>24&1)continue;
            ll to=v<<1;
            if(!(v&1)){
                ll to=v<<1;to|=1;
                if(!st.count(to)){
                    st.insert(to);
                    que.push(to);
                }
            }
            if(st.count(to))continue;
            st.insert(to);
            que.push(to);
        }
        vpl res;
        for(auto bit:st){
            if(bit&1)continue;
            ll cost=0,fav=0;
            per(i,25){
                if(bit>>i&1){
                    fav+=b[i];
                    cost-=c[i];
                    i--;
                }
                else{
                    cost+=a[i];
                }
            }
            res.emplace_back((pl){cost,-fav});
        }
        sort(all(res));//cout << res.size() << endl;
        per(i,res.size()-1){
            chmin(res[i].second,res[i+1].second);
        }
        st.clear();st.insert(0);
        que.push(0);
        while(que.size()){
            ll v=que.front();que.pop();
            if(v>>26&1)continue;
            ll to=v<<1;
            if(!(v&1)){
                ll to=v<<1;to|=1;
                if(!st.count(to)){
                    st.insert(to);
                    que.push(to);
                }
            }
            if(st.count(to))continue;
            st.insert(to);
            que.push(to);
        }
        for(auto bit:st){
            if(bit&1)continue;
            ll cost=0,fav=0;
            per(i,27){
                if(bit>>i&1){
                    fav+=b[i+25];
                    cost-=c[i+25];
                    i--;
                }
                else{
                    cost+=a[i+25];
                }
            }
            auto itr=lower_bound(all(res),make_pair(-cost,-INF));
            if(itr==res.end())continue;
            chmax(ans,fav-itr->second);
        }
    }
    cout << ans << endl;
}