output_description: Print the maximum possible total points of happiness that Taro gains.
  
  * * *
input_description: 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
attempt: a = int(input())
  hahaha = 0
  for i in range(a):
      r = str(input()).split()
      m = [int(u) for u in r]
      hahaha += max(m)
  print(hahaha)
  
problem_description: 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.
samples: [{"input": "3\n    10 40 70\n    20 50 80\n    30 60 90", "output": "210\n    \n\nIf Taro does activities in the order C, B, C, he will gain 70 + 50 + 90 = 210\npoints of happiness.\n\n* * *"}, {"input": "1\n    100 10 1", "output": "100\n    \n\n* * *"}, {"input": "7\n    6 7 8\n    8 8 3\n    2 5 2\n    7 8 6\n    4 6 8\n    2 3 4\n    7 5 1", "output": "46\n    \n\nTaro should do activities in the order C, A, B, A, C, B, A."}]