// Take care of mod becoming -ve


#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define fro(i,s,e) for(auto i=s;i<=e;++i)
#define int long long
#define ld long double
#define fr(i,n) for(auto i=0;i<(int)n;i++)
#define ff first
#define pf pop_front()
#define ss second
#define mp make_pair
#define vi std::vector<int>
#define pii pair<int,int>
#define mii map<int,int>
#define setbits(x) __builtin_popcountll(x)
#define zrbits(x) __builtin_ctzll(x)
#define vii std::vector<int,int>
#define tc int t;cin>>t;while(t--)
#define FILE freopen("input.txt","r",stdin); freopen("output.txt","w",stdout)
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define inp(a) long long a;cin>>a;
#define ps(x,y) fixed<<setprecision(y)<<x
#define mkarr(arr,n,type) type *arr=new type[n];
#define endl "\n"
#define sz size()
const int mod = 1000000007;
#define min_pq priority_queue<int,std::vector<int>,greater<int>>
#define printclock cerr<<"Time : "<<1000*(ld)clock()/(ld)CLOCKS_PER_SEC<<"ms\n";
using namespace std;
const int MAXN = 100005;
const int INF = 1e18;
#define fill(s,x) memset(s,x,sizeof(s));
inline int add(int a, int b) {return ((a % mod + b % mod) % mod);}
inline int sub(int a, int b) {return ((a % mod - b % mod) % mod);}
inline int mult(int a, int b) {return ((a % mod) * (b % mod)) % mod;}
typedef tree<int, null_type, less<int>, rb_tree_tag,
        tree_order_statistics_node_update> indexed_set;
// Use __gcd(a,b) for gcd
// find(all(x),key) to get the iterator and its index is obtained by find(all(x),key)-x.begin()
// find_if(iterator_first,iterator_last,unary function) returns first iterator if any element corresponding to unary function exists and if no such element is found it retrurns the last iterator
/*For example:
find_if(all(x),isodd) for x being a vector{10,25,40,55}; *it returns 25*/
/*search(all(v1),all(v2),pred) searches for all the elements of v2 present in v1 based on pred function the iterator correspond
to the first element of sequence if it exists and if not then th elast iterator is obtained.*/
//use substr(size_t pos,size_t len) for the substrings
int binsearch(int* a, int start, int end, int key) {
    while (start <= end) {
        int mid = start + (end - start) / 2;
        if (a[mid] < key)
            start = mid + 1;
        else if (a[mid] > key)
            end = mid - 1;
        else
            return mid;
    }
    return -1;
}
int power(int a, int b) {
    long long ans = 1;
    while (b > 0) {
        if (b & 1LL) {ans = (ans * a) % mod;}
        a = (a * a) % mod;
        b = (b >> 1LL);
    }
    return ans;
}
int arrsize(int a[]) {
    return *(&a + 1) - a;
}

// int a[2 * MAXN];
// Maximum sub-array sum
void f(int* a, int s, int e, int i) {

}
int series(int x) {
    return ((x * (x + 1)) >> 1LL);
}
void min_self(int &a, int b) {
    a = min(a, b);
}

int32_t main() {
    fio;
    // indexed_set s;
    // s.insert(2);
    // auto y = s.find_by_order(7);
    // cout << *x << " " << *y << endl;
    int N;
    cin >> N;
    int h[N + 1][3];
    for (int i = 1; i <= N; i++) {
        fr(j, 3) {
            cin >> h[i][j];
        }
    }
    int dp[N + 1][3];
    fr(i, N + 1) {
        fr(j, 3) {
            dp[i][j] = 0;
        }
    }
    fr(i, 3) {
        dp[N][i] = h[N][i];
    }
    for (int i = N - 1; i >= 1; i--) {
        fr(j, 3) {
            fr(k, 3) {
                if (k != j) {
                    dp[i][j] = max(dp[i][j], dp[i + 1][k] + h[i][j]);
                }
            }
        }
    }
    int ans = dp[1][0];
    ans = max(ans, dp[1][1]);
    ans = max(ans, dp[1][2]);
    cout << ans << "\n";
    return 0;
}


Measured memory_bytes: 4992