#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int main() {
	int n; cin >> n;
	const int m = 5000;
	vector dp(3, vector<long long>(m + 1, -LINF));
	rep(i, 3)dp[i][0] = 0;
	rep(i, n) {
		vector<int>a(3);
		rep(j, 3)cin >> a[j];
		vector ndp(3, vector<long long>(m + 1, -LINF));
		rep(j, 3)rep(k, m + 1) {
			rep(nj, 3)if (j != nj) {
				int atk = k + a[nj];
				long long dmg = dp[j][k];
				int ove = max(0, atk - (m - 1));
				dmg += (long long)ove*(n - i);
				atk -= ove;
				chmax(ndp[nj][max(0, atk - 1)],dmg + atk);
			}
		}
		swap(dp, ndp);
	}
	long long ans = 0;
	rep(i, 3)rep(j, m + 1)chmax(ans, dp[i][j]);
	cout << ans << endl;
	return 0;
}