#include<bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
 
#define ll int
#define ld long double
#define bigint int64_t
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define mp make_pair
#define pb push_back
#define MOD 1000000007
#define inf 1e15
#define flash ios_base::sync_with_stdio(false);cin.tie(NULL);
#define test ll t;read(t);while(t--)
#define all(v) v.begin(),v.end()
#define pll pair<ll,ll>
 
/*#include <ext/pb_ds/assoc_container.hpp> // Policy_based_Data_Structure 
#include <ext/pb_ds/graph_policy.hpp> 
using namespace __gnu_pbds;*/ 
 
#define forn(i,n) for(ll (i) = 0 ; (i) < (n) ; ++(i))
#define for1(i,n) for(ll (i) = 1 ; (i) <= (n) ; ++(i))
#define forr(i,n) for(ll (i) = (n)-1 ; (i)>=0 ; --(i))
#define forab(i,a,b,c) for(ll (i) = a ; (i) <= (b) ; (i)+=(c))
 
using namespace std;
template <typename T>
void read(T &x){
    cin >> x;
}
template <typename T , typename T0>
void read(T &x,T0 &y){
    cin >> x >> y;
}
 
template <typename T , typename T0 , typename T1>
void read(T &x,T0 &y,T1 &z){
    cin >> x >> y >> z;
}
 
template <typename T , typename T0 , typename T1 , typename T2>
void read(T &x,T0 &y,T1 &z,T2 &w){
    cin >> x >> y >> z >> w;
}
  
template <typename T>
void read(vector< T > &oneD,ll n){
    forn(i,n)
    {
        ll x;
        read(x);
        oneD.push_back(x);
    }
}
 
template <typename T>
void read(T oneD[] , ll n){
    for(ll i=0;i<n;i++){
        read(oneD[i]);
    }
}
 
template <typename T>
void write(vector< T > &oneD,ll n){
    for(ll i=0;i<n;i++){
        cout<<oneD[i]<<" ";
    }
    cout << endl;
}
 
template <typename T>
void write(T oneD[] ,int n){
    for(ll i=0;i<n;i++){
        write(oneD[i]);
    }
    cout << endl;
}
 
vll seive;
void Seive(){
    const ll maxn = 1000005;
    seive.resize(maxn);
    forn(i,maxn) seive[i] = i;
    seive[1] = -1;
    seive[0] = -1;
    forab(i,2,maxn,1) if(i == seive[i]) for(ll j = 2*i ; j < maxn ; j+=i) if(seive[j] == j) seive[j] = i;
}
 
ll extended_GCD(ll a , ll b , ll &x , ll &y){
    if(a == 0){
        x = 0;
        y = 1;
        return b;
    }
    ll x1 , y1;
    ll gcd = extended_GCD(b%a , a , x1 , y1);
    x = y1 - (b/a)*x1; 
    y = x1;
    return gcd;
}
 
ll modinv(ll a , ll mod = MOD){
    ll x , y;
    extended_GCD(a , mod , x , y);
    if(x < 0) x += mod;
    return x;
}
 
//Chinese Remainder Theoram
ll find_x_CRT(ll num[],ll rem[],ll n)
{
    ll pro=1;
    forn(i,n)
    pro*=num[i];
    ll res=0;
    forn(i,n)
    {
        ll pp = pro/num[i];
        res+=(rem[i]*modinv(pp,num[i])*pp);
    }
    res%=pro;
    return res;
}
 
ll power(ll a, ll b, ll m = MOD) {
    a%=m;
    ll res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a %m;
        a = a * a %m;
        b >>= 1;
    }
    return res;
}
 
ll powe(ll a, ll b, ll m = MOD) {
    ll res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a;
        a = a * a;
        b >>= 1;
    }
    return res;
}
 
ll gcd(ll a, ll b)
{
    if (a == 0)
        return b;
    return gcd(b % a, a);
}
 
string getString(char x) 
{ 
    string s(1, x); 
    return s;    
}

void add_edge(ll u,ll v,ll w,vector<vpll> &ad)
{
    ad[u].pb({v,w});
    ad[v].pb({u,w});
}

const ll siz = 1e5+5;
ll dp[siz][3]={};

ll recur(ll st,ll en,ll a[],ll b[],ll c[],ll p)
{
    if(st>=en)
    return 0;
    if(dp[st][p]!=-1)
    return dp[st][p];
    if(p==0)
    {
        ll q2 = a[st]+recur((st+1),en,a,b,c,1);
        ll q3 = a[st]+recur((st+1),en,a,b,c,2);
        dp[st][p]=max(q2,q3);
        return dp[st][p];
    }
    else if(p==1)
    {
        ll q1 = b[st]+recur((st+1),en,a,b,c,0);
        ll q3 = b[st]+recur((st+1),en,a,b,c,2);
        dp[st][p]=max(q1,q3);
        return dp[st][p];
    }
    else
    {
        ll q1 = c[st]+recur((st+1),en,a,b,c,0);
        ll q2 = c[st]+recur((st+1),en,a,b,c,1);
        dp[st][p]=max(q1,q2);
        return dp[st][p];
    }
}

int main()
{
    flash;
    ll n;
    read(n);
    ll a[n]={},b[n]={},c[n]={};
    forn(i,n)
    {
        ll x,y,z;
        read(x,y,z);
        a[i]=x,b[i]=y,c[i]=z;
    }
    forn(i,siz)
    {
        forn(j,3)
        dp[i][j]=-1;
    }
    ll p1 = recur(0,n,a,b,c,0);
    ll p2 = recur(0,n,a,b,c,1);
    ll p3 = recur(0,n,a,b,c,2);
    cout<<max(p1,max(p2,p3));
    return 0;
}

Measured memory_bytes: 12032