#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

ll calc_val(ll x, ll y) {
    // 初項が x で項数 y の公差 -1
    if (x <= y) {
        return x * (x + 1) / 2;
    }
    return (x + x - y + 1) * y / 2;
}

int main() {
    ll N;
    cin >> N;
    vector A(N, vector<ll>(3));
    for (ll i = 0; i < N; i++) {
        for (ll j = 0; j < 3; j++) {
            cin >> A[i][j];
        }
    }
    ll INF = 100000000000000023;
    // 現在の攻撃力が j であるときの与えられるダメージの総和の最大値
    vector dp(N + 1, vector<ll>(3, -INF));
    dp[0][0] = 0;
    dp[0][1] = 0;
    dp[0][2] = 0;
    for (ll i = 0; i < N; i++) {
        // その状態で何ダメージ与えられるか？
        // 攻撃力がどれくらい上がるかを、検証すれば OK
        vector ndp(N + 1, vector<ll>(3, -INF));
        for (ll j = 0; j <= N; j++) {
            // N - i 回加算が行われる
            for (ll k = 0; k < 3; k++) {
                for (ll l = 0; l < 3; l++) {
                    if (k == l) {
                        continue;
                    }
                    // N - i 回のうち、最初の j 回はそのまま加算、残りは等差数列
                    ll prod = min(N - i, j) * A[i][l];
                    ll rem = N - i - j;
                    if (rem > 0) {
                        prod += calc_val(A[i][l], rem);
                    }
                    ndp[min(max(j + A[i][l] - 1, 0LL), N)][l] =
                        max(ndp[min(max(j + A[i][l] - 1, 0LL), N)][l],
                            dp[j][k] + prod);
                }
            }
        }
        // debug(ndp);
        for (ll j = 0; j <= N; j++) {
            for (ll k = 0; k < 3; k++) {
                dp[j][k] = ndp[j][k];
            }
        }
    }
    ll ans = 0;
    for (ll i = 0; i <= N; i++) {
        for (ll j = 0; j < 3; j++) {
            ans = max(ans, dp[i][j]);
        }
    }
    cout << ans << endl;
}