#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace __gnu_pbds;
using namespace std;


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

#define PI              acos(-1.0)
#define en '\n'
#define Infi 0x3f3f3f3f
#define LInfi 0x3f3f3f3f3f3f3f3f



#define READ_IN freopen("Input.txt","r",stdin);
#define READ_OUT freopen("Output.txt","w",stdout);


const int dx[] = {+1,-1,+0,+0};                         // 4 X directions
const int dy[] = {+0,+0,+1,-1};                         // 4 Y directions
const int dx8[] = {+0,+0,+1,-1,-1,+1,-1,+1};            // King X Moves
const int dy8[] = {-1,+1,+0,+0,+1,+1,-1,-1};            // King Y Moves
const int kx[] = {-2, -2, -1, -1,  1,  1,  2,  2};      // Knight X Moves
const int ky[] = {-1,  1, -2,  2, -2,  2, -1,  1};      // Knight Y Moves



int  Set    (int N,int pos) {return N=N | (1<<pos);}    /// turn a bit on
int  reset  (int N,int pos) {return N= N & ~(1<<pos);}  /// turn a bit off
bool check  (int N,int pos) {return (bool)(N & (1<<pos));} /// check, if a bit is on or not

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define trace(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define trace(x...)
#endif

typedef long long int  ll;
typedef unsigned long long int llu;


vector<vector<int>> vec;

int dp[100005][4];

int vaction(int id,int id2){


    if(id>=vec.size())return 0;

    int ans1=0,ans2=0,ans3=0;

    if(dp[id][id2]!=-1)return dp[id][id2];

    if(id2==0){
        int p1 = vec[id][0] + vaction(id+1,1);
        int p2 = vec[id][0] + vaction(id+1,2);

        ans1 = max(p1,p2);
    }
    else if(id2==1){
        int p1 = vec[id][1] + vaction(id+1,0);
        int p2 = vec[id][1] + vaction(id+1,2);

        ans2 = max(p1,p2);
    }
    else if(id2==2){
        int p1 = vec[id][2] + vaction(id+1,1);
        int p2 = vec[id][2] + vaction(id+1,0);

        ans3 = max(p1,p2);
    }

    return dp[id][id2] = max(ans1,max(ans2,ans3));

}

int main(void){


    int n;
    cin >> n;

    vec.assign(n,vector<int>());

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

        for(int j=0;j<3;j++){
            int x;
            cin >> x;
            vec[i].push_back(x);
        }
    }

    memset(dp,-1,sizeof(dp));

    int ans1 = vaction(0,0);
    int ans2 = vaction(0,1);
    int ans3 = vaction(0,2);

    cout << max(ans1,max(ans2,ans3)) << endl;

    return 0;
}


Measured memory_bytes: 13568