// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

typedef long long int lli;

typedef long double ld;

const int oo = 1e9;



int nn;

const int nxx = 1e5+5;

int acc[nxx][3];

int dpp[3][nxx];

int go(int aa, int ii)

{

	if(ii==nn) return 0;

	if(dpp[aa][ii] != -1) return dpp[aa][ii];

	int& ans = dpp[aa][ii];

	if(aa==0)

	{

		ans=max(ans, go(1, ii+1)+acc[ii][0]);

		ans=max(ans, go(2, ii+1)+acc[ii][0]);

	}

	if(aa==1)

	{

		ans=max(ans, go(0, ii+1)+acc[ii][1]);

		ans=max(ans, go(2, ii+1)+acc[ii][1]);

	}

	if(aa==2)

	{

		ans=max(ans, go(0, ii+1)+acc[ii][2]);

		ans=max(ans, go(1, ii+1)+acc[ii][2]);

	}



	return ans;



}

int main()

{

    cin>>nn;

    for(int ii=0; ii<nn; ii++) cin>>acc[ii][0]>>acc[ii][1]>>acc[ii][2];

    memset(dpp, -1, sizeof dpp);

    cout<<max(go(0,0), max(go(1,0),go(2,0)))<<"\n";

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 2.1581898552167718x):
// #pragma GCC optimize("Ofast,O3,unroll-loops")

// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")



#include <vector>

#include <list>

#include <map>

#include <set>

#include <deque>

#include <queue>

#include <stack>

#include <bitset>

#include <algorithm>

#include <functional>

#include <numeric>

#include <utility>

#include <iostream>

#include <sstream>

#include <iomanip>

#include <cstdio>

#include <cmath>

#include <cstdlib>

#include <cctype>

#include <string>

#include <cstring>

#include <cstdio>

#include <cmath>

#include <cstdlib>

#include <ctime>

#include <climits>

#include <complex>

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/tree_policy.hpp>



using namespace __gnu_pbds;

using namespace std;



#define endl '\n'

#define hoise cerr<<"hoise - "<<__LINE__<<"\n"

#define tham getchar()

#define set0(ar) memset(ar, 0, sizeof ar)

#define setinf(ar) memset(ar, 126, sizeof ar)

#define vsort(v) sort(v.begin(), v.end())

#define all(x) (x).begin(), (x).end()

#define FASTIO ios::sync_with_stdio(false);cin.tie(nullptr)



using ll = long long;

using pii = pair <int, int>;

using pll = pair <ll, ll>;

using vi = vector <int>;

using vl = vector <ll>;

using vpii = vector < pii >;

using vpll = vector < pll >;



const int LOG = 20;

const int N = (int)2e5+6;

const double PI = acos(-1.0);

const ll MOD = 1e9 + 7;

const int INF = 1e9;

const double EPS = 1e-6;

const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

const int knight_x[8] = {2, 1, -1, -2, -2, -1, 2, 1}, knight_y[8] = {1, 2, 2, 1, -1, -2, -1, -2};



#define dbg(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }

void err(istream_iterator<string> it) {}

template<typename T, typename... Args>

void err(istream_iterator<string> it, T a, Args... args) {

    cerr << *it << " = " << a << " ";

    err(++it, args...);

    cout << endl;

}



int flipBit (int mask, int k) { return mask = mask ^ (1 << k); }

bool checkBit (int mask, int k) { return (mask >> k) & 1; }

int setBit (int mask, int k) { return mask = mask | (1 << k); }

int resetBit (int mask, int k) { if (checkBit (mask, k)) { mask = flipBit (mask, k); } return mask; }



inline void normal(ll &a) { a %= MOD; (a < 0) && (a += MOD); }

inline ll modMul(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a * b) % MOD; }

inline ll modAdd(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a + b) % MOD; }

inline ll modSub(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); a -= b; normal(a); return a; }

inline ll modPow(ll b, ll p) { ll r = 1; while (p) { if (p & 1) r = modMul(r, b); b = modMul(b, b); p >>= 1; } return r; }

inline ll modInverse(ll a) { return modPow(a, MOD - 2); }

inline ll modDiv(ll a, ll b) { return modMul(a, modInverse(b)); }



template <typename T> using orderedSet = tree<T, null_type, greater<T>, rb_tree_tag, tree_order_statistics_node_update>;

template <typename T> using orderedSet1 = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;



bool equalTo ( double a, double b ) { if ( fabs ( a - b ) <= EPS ) return true;	else return false; }

bool notEqual ( double a, double b ){ if ( fabs ( a - b ) > EPS ) return true;	else return false; }

bool lessThan ( double a, double b ){ if ( a + EPS < b ) return true;	else return false; }

bool lessThanEqual ( double a, double b ){ if ( a < b + EPS ) return true;	else return false;}

bool greaterThan ( double a, double b ){ if ( a > b + EPS ) return true;	else return false;}

bool greaterThanEqual ( double a, double b ){ if ( a + EPS > b ) return true;	else return false;}



int kase;



/*--------------------------------------------------------------------------------------------------------------------------*/



void solution () {

	int n;

	cin >> n;

	vi a (n), b (n), c (n);

	vector <vector <int> > dp (n + 1, vector <int> (3, 0));

	

	for (int i = 0; i < n; ++i) {

		cin >> a[i] >> b[i] >> c[i];

	}

	

	for (int i = n - 1; i >= 0; --i) {

		dp[i][0] = max (b[i] + dp[i + 1][1], c[i] + dp[i + 1][2]);

		dp[i][1] = max (a[i] + dp[i + 1][0], c[i] + dp[i + 1][2]);

		dp[i][2] = max (a[i] + dp[i + 1][0], b[i] + dp[i + 1][1]);

	}

	cout << max ({dp[0][0], dp[0][1], dp[0][2]}) << endl;

}



int main() {

	FASTIO;

	// freopen ("out.txt", "w", stdout);

	int tc;

	// cin >> tc;

	tc = 1;

	

	while (tc--) {

		solution ();

	}

	

    return 0;

}



/*

 * check corner cases

 * be careful before submitting in Lightoj, SPOJ, UVA

*/