Problem:
Score : 100 points

Problem Statement

Taro's summer vacation starts tomorrow, and he has decided to make plans for it now.

The vacation consists of N days.
For each i (1 \leq i \leq N), Taro will choose one of the following activities and do it on the i-th day:

A: Swim in the sea. Gain a_i points of happiness.

B: Catch bugs in the mountains. Gain b_i points of happiness.

C: Do homework at home. Gain c_i points of happiness.

As Taro gets bored easily, he cannot do the same activities for two or more consecutive days.

Find the maximum possible total points of happiness that Taro gains.

Constraints

All values in input are integers.

1 \leq N \leq 10^5

1 \leq a_i, b_i, c_i \leq 10^4

Input

Input is given from Standard Input in the following format:

N
a_1 b_1 c_1
a_2 b_2 c_2
:
a_N b_N c_N

Output

Print the maximum possible total points of happiness that Taro gains.

Sample Input 1

3
10 40 70
20 50 80
30 60 90

Sample Output 1

210

If Taro does activities in the order C, B, C, he will gain 70 + 50 + 90 = 210 points of happiness.

Sample Input 2

1
100 10 1

Sample Output 2

100

Sample Input 3

7
6 7 8
8 8 3
2 5 2
7 8 6
4 6 8
2 3 4
7 5 1

Sample Output 3

46

Taro should do activities in the order C, A, B, A, C, B, A.

Solution in C (GCC 5.4.1) (judge verdict: Accepted)

#include<stdio.h>
#include<stdlib.h>
long minf(long a,long b){
  if(a>b){
    return b;
  }else{
    return a;
  }
}

long maxf(long a,long b){
  if(a>b){
    return a;
  }else{
    return b;
  }
}

int main(){
  long n = 0;
  long a[100000][3] = {};
  long dp[100000][3] = {};
  long k = 0;
  long i = 0;
  long j = 0;
  long min = -1;
  long max = -1;
  
  scanf("%ld",&n);
  
  for(i=0;i<n;i++){
    scanf("%ld %ld %ld",&a[i][0],&a[i][1],&a[i][2]);
  }
  
  dp[0][0] = a[0][0];
  dp[0][1] = a[0][1];
  dp[0][2] = a[0][2];
  
  for(i=1;i<n;i++){
    for(j=0;j<3;j++){
      max = -1;
      for(k=0;k<3;k++){
        if(j != k){
          if(max == -1){
            max = dp[i-1][k] + a[i][j];
          }else{
            max = maxf(max,dp[i-1][k] + a[i][j]);
          }
        }
      }
      dp[i][j] = max;
      //printf("%ld.%ld-%ld,",max,i,j);
    }  
  }
  max = maxf(dp[n-1][0],dp[n-1][1]);
  max = maxf(max,dp[n-1][2]);
  printf("%ld",max);
  return 0;
}