{"raw_statement":[{"iden":"problem statement","content":"Taro's summer vacation starts tomorrow, and he has decided to make plans for it now.\nThe 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:\n\n*   A: Swim in the sea. Gain $a_i$ points of happiness.\n*   B: Catch bugs in the mountains. Gain $b_i$ points of happiness.\n*   C: Do homework at home. Gain $c_i$ points of happiness.\n\nAs Taro gets bored easily, he cannot do the same activities for two or more consecutive days.\nFind the maximum possible total points of happiness that Taro gains."},{"iden":"constraints","content":"*   All values in input are integers.\n*   $1 \\leq N \\leq 10^5$\n*   $1 \\leq a_i, b_i, c_i \\leq 10^4$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$a_1$ $b_1$ $c_1$\n$a_2$ $b_2$ $c_2$\n$:$\n$a_N$ $b_N$ $c_N$"},{"iden":"sample input 1","content":"3\n10 40 70\n20 50 80\n30 60 90"},{"iden":"sample output 1","content":"210\n\nIf Taro does activities in the order C, B, C, he will gain $70 + 50 + 90 = 210$ points of happiness."},{"iden":"sample input 2","content":"1\n100 10 1"},{"iden":"sample output 2","content":"100"},{"iden":"sample input 3","content":"7\n6 7 8\n8 8 3\n2 5 2\n7 8 6\n4 6 8\n2 3 4\n7 5 1"},{"iden":"sample output 3","content":"46\n\nTaro should do activities in the order C, A, B, A, C, B, A."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}