stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
/*

██╗  ██╗ █████╗ ██████╗ ███████╗███████╗███╗   ███╗        ██╗  ██╗██╗  ██╗ █████╗ ██╗     ███████╗██████╗

██║ ██╔╝██╔══██╗██╔══██╗██╔════╝██╔════╝████╗ ████║        ██║ ██╔╝██║  ██║██╔══██╗██║     ██╔════╝██╔══██╗

█████╔╝ ███████║██████╔╝█████╗  █████╗  ██╔████╔██║        █████╔╝ ███████║███████║██║     █████╗  ██║  ██║

██╔═██╗ ██╔══██║██╔══██╗██╔══╝  ██╔══╝  ██║╚██╔╝██║        ██╔═██╗ ██╔══██║██╔══██║██║     ██╔══╝  ██║  ██║

██║  ██╗██║  ██║██║  ██║███████╗███████╗██║ ╚═╝ ██║███████╗██║  ██╗██║  ██║██║  ██║███████╗███████╗██████╔╝

╚═╝  ╚═╝╚═╝  ╚═╝╚═╝  ╚═╝╚══════╝╚══════╝╚═╝     ╚═╝╚══════╝╚═╝  ╚═╝╚═╝  ╚═╝╚═╝  ╚═╝╚══════╝╚══════╝╚═════╝

Believe in yourself ,( try and try and then try ), You can do it 

*/

#define _CRT_SECURE_NO_WARNINGS

#include<bits/stdc++.h>

#include<unordered_map>

#define endl "\n"

#define Ceil(x,y) ((x+y-1)/y)

#define clr(arr, x) memset(arr, x, sizeof arr)

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

#define allr(s) s.rbegin(),s.rend()

#define rt(s) return cout<<s,0

#define watch(x) cout<<(#x)<<" = "<<x<<endl

#define sz(s)	(int)(s.size())

#define OO 0x3f3f3f3f3f3f3f3fLL

const int oo = 0x3f3f3f3f, mod = 1e9 + 7;

using namespace std;

typedef long long ll;

typedef long double ld;

typedef unsigned long long ull;

//x = xDegrees*3.14159265 / 180;

//ef1tn=(( (n / 2)*( (n / 2) + 1) / 2) * 2);

//of1tn=(n * (n + 1) / 2 - 2 * ((n / 2) * (n / 2 + 1) / 2));

int dx[] { 1, -1, 0, 0, 1, 1, -1, -1 };

int dy[] { 0, 0, 1, -1, 1, -1, 1, -1 };

void K_K(){

#ifndef ONLINE_JUDGE

//	freopen("in.txt", "r", stdin);

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

#endif  !ONLINEJUDGE

	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

}

ll gcd(ll a, ll b) {

	return b == 0 ? abs(a) : gcd(b, a % b);

}

ll lcm(ll a, ll b) {

	return a / gcd(a, b) * b;

}

int n;

vector<int>a, b, c;

int dp[100005][5];

int sol(int idx, int pre){

	if (idx == n)

		return 0;

	int& ret = dp[idx][pre];

	if (~ret)

		return ret;

	int ch1 = 0, ch2 = 0, ch3 = 0;

	if (pre != 1)

		ch1 = sol(idx + 1, 1) + a[idx];

	if (pre != 2)

		ch2 = sol(idx + 1, 2) + b[idx];

	if (pre != 3)

		ch3 = sol(idx + 1, 3) + c[idx];

	return ret = max({ ch1, ch2, ch3 });

}

int main(){

	K_K();

	cin >> n;

	a.resize(n);

	b.resize(n);

	c.resize(n);

	clr(dp, -1);

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

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

	cout << sol(0, 0);

}

// Faster C++ solution for the same problem (measured speedup: 1.3682060098392739x):
#include<bits/stdc++.h>

using namespace std;

int a[100000+5];

int b[100000+5];

int c[100000+5];



int main(int argc, char const *argv[])

{

	int N;

	while(cin >> N) {

		memset(a, 0, sizeof(a));

		memset(b, 0, sizeof(b));

		memset(c, 0, sizeof(c));

		for(int i=1; i<=N; i++){

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

		}

		for(int i=2; i<=N; i++){

			int tempa = a[i - 1];

			int tempb = b[i - 1];

			int tempc = c[i - 1];

			a[i] = a[i] + max(tempb, tempc);

			b[i] = b[i] + max(tempa, tempc);

			c[i] = c[i] + max(tempa, tempb);

		}

	    cout << max(a[N], max(b[N], c[N])) << endl;

    }

	return 0;

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

using namespace std;



#define ll long long

#define size 100001



int a[size];

int b[size];

int c[size];

int dp[size][4];



int max_sum(int n, int p)

{

    if(n <= 0)

        return 0;

    if(n > 0 && dp[n][p] != -1)

        return dp[n][p];

    int ans = INT_MIN;

    if(p != 0)

    {

        ans = max(ans,a[n]+max_sum(n-1,0));

    }

    if(p != 1)

    {

        ans = max(ans,b[n]+max_sum(n-1,1));

    }

    if(p != 2)

    {

        ans = max(ans,c[n]+max_sum(n-1,2));

    }



    return dp[n][p] = ans;

}







int main()

{

  //OJ;

  int t = 1;

  //cin>>t;

  while(t--){

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

  int n;

  cin>>n;



  for(int i = 1; i <= n; i++)

  {

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

  }

  cout<<max_sum(n,3)<<endl;

  }

   return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.183587043239877x):
#include<bits/stdc++.h>

using namespace std;

int a[100000+5];

int b[100000+5];

int c[100000+5];



int main(int argc, char const *argv[])

{

	int N;

	while(cin >> N) {

		memset(a, 0, sizeof(a));

		memset(b, 0, sizeof(b));

		memset(c, 0, sizeof(c));

		for(int i=1; i<=N; i++){

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

		}

		for(int i=2; i<=N; i++){

			int tempa = a[i - 1];

			int tempb = b[i - 1];

			int tempc = c[i - 1];

			a[i] = a[i] + max(tempb, tempc);

			b[i] = b[i] + max(tempa, tempc);

			c[i] = c[i] + max(tempa, tempb);

		}

	    cout << max(a[N], max(b[N], c[N])) << endl;

    }

	return 0;

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





using namespace std;



vector<vector<int>> vec(100007);

int n;



long long meme[100007][5];





long long solve(int index, int flag){

    if(index==n){

        return 0;

    }

    

    long long &res = meme[index][flag]; 

    

    if(res != -1){

        return res;

    }

    res = 0;

    

    if(flag!=0){

        res = max(res,vec[index][0]+solve(index+1,0));

    }

    if(flag!=1){

        res =  max(res,vec[index][1]+solve(index+1,1));

    }

    if(flag!=2){

        res =  max(res,vec[index][2]+solve(index+1,2));

    }

    return res;

}



int main(){

    cin>>n;

    int num1,num2,num3;

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

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

        cin>>num1>>num2>>num3;

        vec[i].push_back(num1);

        vec[i].push_back(num2);

        vec[i].push_back(num3);

    }

    long long sol = solve(0,3);

    cout<<sol<<endl;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 3.6512819023070286x):
#include<bits/stdc++.h>

using namespace std;

int a[100000+5];

int b[100000+5];

int c[100000+5];



int main(int argc, char const *argv[])

{

	int N;

	while(cin >> N) {

		memset(a, 0, sizeof(a));

		memset(b, 0, sizeof(b));

		memset(c, 0, sizeof(c));

		for(int i=1; i<=N; i++){

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

		}

		for(int i=2; i<=N; i++){

			int tempa = a[i - 1];

			int tempb = b[i - 1];

			int tempc = c[i - 1];

			a[i] = a[i] + max(tempb, tempc);

			b[i] = b[i] + max(tempa, tempc);

			c[i] = c[i] + max(tempa, tempb);

		}

	    cout << max(a[N], max(b[N], c[N])) << endl;

    }

	return 0;

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

#define inf 1000000007

#define N 100007

using namespace std;



int a[N];

int b[N];

int c[N];

int n;

long long mem[N][3];



long long dp(int i, int j)

{

    if(i >= n)

        return 0;

    if(mem[i][j] != -1)

        return mem[i][j];

    long long ans = 0;

    for(int k = 0;k < 3;k++)

    {

        if(k == 0 && k != j)

        {

            long long val = a[i] + dp(i + 1, k);

            ans = max(ans, val);

        }

        if(k == 1 && k != j)

        {

            long long val = b[i] + dp(i + 1, k);

            ans = max(ans, val);

        }

        if(k == 2 && k != j)

        {

            long long val = c[i] + dp(i + 1, k);

            ans = max(ans, val);

        }

    }

    mem[i][j] = ans;

    return ans;

}



int main()

{

    //freopen("input.txt", "r", stdin);

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

    cin >> n;

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

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

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

    long long val1 = dp(0, 0);

    long long val2 = dp(0, 1);

    long long val3 = dp(0, 2);

    long long ans = max(val1, val2);

    ans = max(ans, val3);

    cout << ans << endl;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.5414333742764108x):
#include<bits/stdc++.h>

using namespace std;

int a[100000+5];

int b[100000+5];

int c[100000+5];



int main(int argc, char const *argv[])

{

	int N;

	while(cin >> N) {

		memset(a, 0, sizeof(a));

		memset(b, 0, sizeof(b));

		memset(c, 0, sizeof(c));

		for(int i=1; i<=N; i++){

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

		}

		for(int i=2; i<=N; i++){

			int tempa = a[i - 1];

			int tempb = b[i - 1];

			int tempc = c[i - 1];

			a[i] = a[i] + max(tempb, tempc);

			b[i] = b[i] + max(tempa, tempc);

			c[i] = c[i] + max(tempa, tempb);

		}

	    cout << max(a[N], max(b[N], c[N])) << endl;

    }

	return 0;

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

using namespace std;

using ll = long long;

using ii = pair<int, int>;

using iii = pair<ii, int>;

#define vt vector

#define pq priority_queue

#define pb push_back

#define pf push_front

#define mp make_pair

#define fi first

#define se second

#define __lcm(a, b) a * b / __gcd(a, b)

const int MOD = 1e9 + 7;

const int INF = 2e9;

const int N = 1e5 + 5;



int n;

int a[N], b[N], c[N];

int dp[N][5];



int f(int idx, int now) {

    if(idx == n) return 0;

    int &sol = dp[idx][now];

    if(sol != -1) return sol;

    if(now == 0) {

        sol = max(f(idx + 1, 1) + a[idx + 1], 

              max(f(idx + 1, 2) + b[idx + 1], 

                  f(idx + 1, 3) + c[idx + 1]));

    } else if(now == 1) {

        sol = max(f(idx + 1, 2) + b[idx + 1],

                  f(idx + 1, 3) + c[idx + 1]);

    } else if(now == 2) {

        sol = max(f(idx + 1, 1) + a[idx + 1],

                  f(idx + 1, 3) + c[idx + 1]);

    } else {

        sol = max(f(idx + 1, 1) + a[idx + 1],

                  f(idx + 1, 2) + b[idx + 1]);

    }

    return sol;

}



void solve() {

    cin >> n;

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

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

    }

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

    cout << f(0, 0) << "\n";

}



int main() {

 

    ios_base::sync_with_stdio(0);

    cin.tie(0); cout.tie(0);

    

    solve();

    

}

// Faster C++ solution for the same problem (measured speedup: 1.3672318476515068x):
#include<bits/stdc++.h>

using namespace std;

int a[100000+5];

int b[100000+5];

int c[100000+5];



int main(int argc, char const *argv[])

{

	int N;

	while(cin >> N) {

		memset(a, 0, sizeof(a));

		memset(b, 0, sizeof(b));

		memset(c, 0, sizeof(c));

		for(int i=1; i<=N; i++){

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

		}

		for(int i=2; i<=N; i++){

			int tempa = a[i - 1];

			int tempb = b[i - 1];

			int tempc = c[i - 1];

			a[i] = a[i] + max(tempb, tempc);

			b[i] = b[i] + max(tempa, tempc);

			c[i] = c[i] + max(tempa, tempb);

		}

	    cout << max(a[N], max(b[N], c[N])) << endl;

    }

	return 0;

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

using namespace std;



int ar[100010][5],n;

int dp[100010][5];



int call(int i,int f)

{



    if(i==n)

        return 0;



    if(dp[i][f]!=-1)

        return dp[i][f];



    int ans=0;



    if(f==0)

        ans+=max(ar[i][1]+call(i+1,1),ar[i][2]+call(i+1,2));



    else if(f==1)

        ans+=max(ar[i][0]+call(i+1,0),ar[i][2]+call(i+1,2));

    else

        ans+=max(ar[i][1]+call(i+1,1),ar[i][0]+call(i+1,0));



        dp[i][f]=ans;

        return ans;



}



int main()

{



    cin>>n;



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

        cin>>ar[i][0]>>ar[i][1]>>ar[i][2];



    memset(dp,-1,sizeof dp);



    int ans=max(max(call(0,0),call(0,1)),call(0,2));



    cout<<ans<<endl;



}


// Faster C++ solution for the same problem (measured speedup: 2.9608623388556263x):
/* BISMILLAHIR RAHMANIR RAHIM */

#include<bits/stdc++.h>

using namespace std;

#define ll        long long

#define ull       unsigned long long

#define sd(x)     scanf("%lf", &x)

#define l0(i,n)   for(ll i=0; i<n; i++)

#define MAX       100005

#define maxn 	  200005

#define pb 		  push_back

#define mk 		  make_pair

#define endl	  "\n"

#define INF 	  1000000000

#define MOD		  1000000007

#define imie(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "





int main()

{

	int n;

	cin >> n;

	vector<int> hap[n+5];

	vector<int> dp[n+5];

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

	{

		int a,b,c;

		cin >> a >> b >> c;

		hap[i].pb(a);

		hap[i].pb(b);

		hap[i].pb(c);

		dp[i].pb(0);

		dp[i].pb(0);

		dp[i].pb(0);

	}

	//memset(dp,0,sizeof(dp));

	dp[0][0] = hap[0][0];

	dp[0][1] = hap[0][1];

	dp[0][2] = hap[0][2];

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

			dp[i][0] = hap[i][0]+max(dp[i-1][1], dp[i-1][2]);

			dp[i][1] = hap[i][1]+max(dp[i-1][0], dp[i-1][2]);

			dp[i][2] = hap[i][2]+max(dp[i-1][0], dp[i-1][1]);

	}

	int ans = *max_element(dp[n-1].begin(),dp[n-1].end());

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

//	{

//		ans = max(ans,dp[n-1][i]);

//	}

	cout << ans << endl;

	return 0;

}
// Slower C++ solution:


#include<bits/stdc++.h>

using namespace std;



#define MAX 100000



int dp[MAX+5][4];

int val[MAX+5][4];

int n;



void initialize()

{

    for(int i=0;i<=MAX;i++)

        for(int j=0;j<=3;j++)

            dp[i][j] = -1;

}



int vacation(int i, int j)

{

    if(i<=0) return 0;



  /*  if(i==1)

    {

        return val[i][j];

    }

*/

    if(dp[i][j]!=-1) return dp[i][j];



    int mx = INT_MIN;



    for(int k=1;k<=3;k++)

    {

        if(j==k) continue;



        mx = max(mx, vacation(i-1, k)+ val[i][j]);

    }





    dp[i][j] = mx;



    return mx;

}



int main()

{

    initialize();



    cin>>n;

    for(int i=1;i<=n;i++)

    {

        for(int j=1;j<=3;j++)

            cin>>val[i][j];

    }



    int retVal1 = vacation(n, 1);



    initialize();



    int retVal2 = vacation(n, 2);



    initialize();



    int retVal3 = vacation(n, 3);



    cout<<max({retVal1, retVal2, retVal3})<<endl;



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 3.579538694994065x):
/* BISMILLAHIR RAHMANIR RAHIM */

#include<bits/stdc++.h>

using namespace std;

#define ll        long long

#define ull       unsigned long long

#define sd(x)     scanf("%lf", &x)

#define l0(i,n)   for(ll i=0; i<n; i++)

#define MAX       100005

#define maxn 	  200005

#define pb 		  push_back

#define mk 		  make_pair

#define endl	  "\n"

#define INF 	  1000000000

#define MOD		  1000000007

#define imie(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "





int main()

{

	int n;

	cin >> n;

	vector<int> hap[n+5];

	vector<int> dp[n+5];

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

	{

		int a,b,c;

		cin >> a >> b >> c;

		hap[i].pb(a);

		hap[i].pb(b);

		hap[i].pb(c);

		dp[i].pb(0);

		dp[i].pb(0);

		dp[i].pb(0);

	}

	//memset(dp,0,sizeof(dp));

	dp[0][0] = hap[0][0];

	dp[0][1] = hap[0][1];

	dp[0][2] = hap[0][2];

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

			dp[i][0] = hap[i][0]+max(dp[i-1][1], dp[i-1][2]);

			dp[i][1] = hap[i][1]+max(dp[i-1][0], dp[i-1][2]);

			dp[i][2] = hap[i][2]+max(dp[i-1][0], dp[i-1][1]);

	}

	int ans = *max_element(dp[n-1].begin(),dp[n-1].end());

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

//	{

//		ans = max(ans,dp[n-1][i]);

//	}

	cout << ans << endl;

	return 0;

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

using namespace std;

int arr[100010][5];

int dp[100010][5];



int vac(int a, int b){

	if(a == 0) return 0;

	if(dp[a][b] != -1) return dp[a][b];

	

	for(int i = 1; i <= 3; i++){

		if(i != b){

			dp[a][b] = max(dp[a][b], vac(a - 1,i) + arr[a][i]);

		}

	}

	

	return dp[a][b];

}



int main (){

	memset(dp,-1,sizeof dp);

	int n;

	cin >> n;

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

		cin >> arr[i][1] >> arr[i][2] >> arr[i][3];

	}

	

	

	int ans = 0;

	for(int i = 1; i <= 3; i++){

		ans = max(ans , vac(n - 1, i) + arr[n][i]);

	}

	

	cout << ans << endl;

	

}

// Faster C++ solution for the same problem (measured speedup: 2.963648140010889x):
/* BISMILLAHIR RAHMANIR RAHIM */

#include<bits/stdc++.h>

using namespace std;

#define ll        long long

#define ull       unsigned long long

#define sd(x)     scanf("%lf", &x)

#define l0(i,n)   for(ll i=0; i<n; i++)

#define MAX       100005

#define maxn 	  200005

#define pb 		  push_back

#define mk 		  make_pair

#define endl	  "\n"

#define INF 	  1000000000

#define MOD		  1000000007

#define imie(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "





int main()

{

	int n;

	cin >> n;

	vector<int> hap[n+5];

	vector<int> dp[n+5];

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

	{

		int a,b,c;

		cin >> a >> b >> c;

		hap[i].pb(a);

		hap[i].pb(b);

		hap[i].pb(c);

		dp[i].pb(0);

		dp[i].pb(0);

		dp[i].pb(0);

	}

	//memset(dp,0,sizeof(dp));

	dp[0][0] = hap[0][0];

	dp[0][1] = hap[0][1];

	dp[0][2] = hap[0][2];

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

			dp[i][0] = hap[i][0]+max(dp[i-1][1], dp[i-1][2]);

			dp[i][1] = hap[i][1]+max(dp[i-1][0], dp[i-1][2]);

			dp[i][2] = hap[i][2]+max(dp[i-1][0], dp[i-1][1]);

	}

	int ans = *max_element(dp[n-1].begin(),dp[n-1].end());

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

//	{

//		ans = max(ans,dp[n-1][i]);

//	}

	cout << ans << endl;

	return 0;

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

using namespace std;

#define INF INT_MAX

#define N 100005

#define K 3

int n, k;

int arr[N][K];

int dp[N][K];

int solve(int idx, int last_k){

    int res;

    if(idx == n)

        return 0;

    if(~last_k && ~dp[idx][last_k])

        return dp[idx][last_k];

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

        if(last_k != i){

            dp[idx][last_k] = max(dp[idx][last_k], arr[idx][i]+solve(idx+1, i));

        }

    }

    return dp[idx][last_k];

}

int main()

{

    cin >> n;

    memset(dp, -1, sizeof(dp[0][0]) * N * K);

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

        for(int j=0; j<3; ++j)

            cin >> arr[i][j];

    cout << solve(0, -1);

    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 2.1650499689934906x):
/* BISMILLAHIR RAHMANIR RAHIM */

#include<bits/stdc++.h>

using namespace std;

#define ll        long long

#define ull       unsigned long long

#define sd(x)     scanf("%lf", &x)

#define l0(i,n)   for(ll i=0; i<n; i++)

#define MAX       100005

#define maxn 	  200005

#define pb 		  push_back

#define mk 		  make_pair

#define endl	  "\n"

#define INF 	  1000000000

#define MOD		  1000000007

#define imie(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "





int main()

{

	int n;

	cin >> n;

	vector<int> hap[n+5];

	vector<int> dp[n+5];

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

	{

		int a,b,c;

		cin >> a >> b >> c;

		hap[i].pb(a);

		hap[i].pb(b);

		hap[i].pb(c);

		dp[i].pb(0);

		dp[i].pb(0);

		dp[i].pb(0);

	}

	//memset(dp,0,sizeof(dp));

	dp[0][0] = hap[0][0];

	dp[0][1] = hap[0][1];

	dp[0][2] = hap[0][2];

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

			dp[i][0] = hap[i][0]+max(dp[i-1][1], dp[i-1][2]);

			dp[i][1] = hap[i][1]+max(dp[i-1][0], dp[i-1][2]);

			dp[i][2] = hap[i][2]+max(dp[i-1][0], dp[i-1][1]);

	}

	int ans = *max_element(dp[n-1].begin(),dp[n-1].end());

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

//	{

//		ans = max(ans,dp[n-1][i]);

//	}

	cout << ans << endl;

	return 0;

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

typedef long long ll;

using namespace std;

const int N = 2e5+10 , M = 5e5+10, OO = 0x3f3f3f3f ,  MOD = 1e9+7;

const double EPS = 1e-3;

#define M_PI 3.14159265358979323846

#define clr(arr,val) memset(arr , val , sizeof (arr))

#define loop(i,n) for(int i = 0;i < int(n);i++)

#define rloop(i,n) for(int i = int(n)-1;i >= 0;i--)

#define range(i,a,b) for(int i = int(a);i <= int(b);i++)

#define pb push_back

#define F first

#define S second

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

#define sz(v)  ((int)((v).size()))

typedef pair <int,int> pii ;

typedef vector < pii > vii ;

typedef vector < int > vi;

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

//int dx[]={1,1,0,-1,-1,-1,0,1};int dy[]={0,1,1,1,0,-1,-1,-1};//8 direction

//int dx[]={2,1,-1,-2,-2,-1,1,2};int dy[]={1,2,2,1,-1,-2,-2,-1};//Knight Direction

//int dx[6]={2,1,-1,-2,-1,1};int dy[6]={0,1,1,0,-1,-1}; //Hexagonal Direction

//freopen("input.txt", "r", stdin);

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







int n,x;

int a[N],b[N],c[N];

ll dp[N][4];





ll solve(int idx, int preC){ //preColour = (1 : a) -- (2 : b) -- (3 : c) -- (0 : invalid)



    if(idx == n) return 0;



    ll& ret = dp[idx][preC];

    if(~ret) return ret;



    ret = -OO;

    if(preC != 1) ret = max(ret, solve(idx+1 , 1)+a[idx]);

    if(preC != 2) ret = max(ret, solve(idx+1 , 2)+b[idx]);

    if(preC != 3) ret = max(ret, solve(idx+1 , 3)+c[idx]);



    return ret;



}







int main(){





    //ios_base::sync_with_stdio(0);

    //cin.tie(0);cout.tie(0);





    scanf("%d",&n);

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

        scanf("%d %d %d",a+i,b+i,c+i);



    memset(dp, -1 , sizeof dp);

    ll ans = solve(0 , 0);

    printf("%lld\n",ans);







    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 7.530449954323744x):
/* BISMILLAHIR RAHMANIR RAHIM */

#include<bits/stdc++.h>

using namespace std;

#define ll        long long

#define ull       unsigned long long

#define sd(x)     scanf("%lf", &x)

#define l0(i,n)   for(ll i=0; i<n; i++)

#define MAX       100005

#define maxn 	  200005

#define pb 		  push_back

#define mk 		  make_pair

#define endl	  "\n"

#define INF 	  1000000000

#define MOD		  1000000007

#define imie(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "





int main()

{

	int n;

	cin >> n;

	vector<int> hap[n+5];

	vector<int> dp[n+5];

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

	{

		int a,b,c;

		cin >> a >> b >> c;

		hap[i].pb(a);

		hap[i].pb(b);

		hap[i].pb(c);

		dp[i].pb(0);

		dp[i].pb(0);

		dp[i].pb(0);

	}

	//memset(dp,0,sizeof(dp));

	dp[0][0] = hap[0][0];

	dp[0][1] = hap[0][1];

	dp[0][2] = hap[0][2];

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

			dp[i][0] = hap[i][0]+max(dp[i-1][1], dp[i-1][2]);

			dp[i][1] = hap[i][1]+max(dp[i-1][0], dp[i-1][2]);

			dp[i][2] = hap[i][2]+max(dp[i-1][0], dp[i-1][1]);

	}

	int ans = *max_element(dp[n-1].begin(),dp[n-1].end());

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

//	{

//		ans = max(ans,dp[n-1][i]);

//	}

	cout << ans << endl;

	return 0;

}
// Slower C++ solution:
#include <iostream>

#include <cstring>

using namespace std;

const int maxn=1e5+5;

const int inf=0x3f3f3f3f;

int dp[maxn][4];

int a[maxn],b[maxn],c[maxn];

int main()

{

   int n;

   cin>>n;

   memset(dp,0,sizeof(dp));

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

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

   }

   dp[1][1]=a[1];

   dp[1][2]=b[1];

   dp[1][3]=c[1];

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

       dp[i][1]=max(dp[i-1][2]+a[i],dp[i-1][3]+a[i]);

       dp[i][2]=max(dp[i-1][1]+b[i],dp[i-1][3]+b[i]);

       dp[i][3]=max(dp[i-1][2]+c[i],dp[i-1][1]+c[i]);

   }

   cout<<max(dp[n][1],max(dp[n][2],dp[n][3]))<<endl;

   return 0;

}


// Faster C++ solution for the same problem (measured speedup: 2.5685700004776515x):
/* BISMILLAHIR RAHMANIR RAHIM */

#include<bits/stdc++.h>

using namespace std;

#define ll        long long

#define ull       unsigned long long

#define sd(x)     scanf("%lf", &x)

#define l0(i,n)   for(ll i=0; i<n; i++)

#define MAX       100005

#define maxn 	  200005

#define pb 		  push_back

#define mk 		  make_pair

#define endl	  "\n"

#define INF 	  1000000000

#define MOD		  1000000007

#define imie(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "





int main()

{

	int n;

	cin >> n;

	vector<int> hap[n+5];

	vector<int> dp[n+5];

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

	{

		int a,b,c;

		cin >> a >> b >> c;

		hap[i].pb(a);

		hap[i].pb(b);

		hap[i].pb(c);

		dp[i].pb(0);

		dp[i].pb(0);

		dp[i].pb(0);

	}

	//memset(dp,0,sizeof(dp));

	dp[0][0] = hap[0][0];

	dp[0][1] = hap[0][1];

	dp[0][2] = hap[0][2];

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

			dp[i][0] = hap[i][0]+max(dp[i-1][1], dp[i-1][2]);

			dp[i][1] = hap[i][1]+max(dp[i-1][0], dp[i-1][2]);

			dp[i][2] = hap[i][2]+max(dp[i-1][0], dp[i-1][1]);

	}

	int ans = *max_element(dp[n-1].begin(),dp[n-1].end());

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

//	{

//		ans = max(ans,dp[n-1][i]);

//	}

	cout << ans << endl;

	return 0;

}