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≤i≤N), Taro will choose one of the following activities and do it on the i-th day:

• Swim in the sea. Gain a_i points of happiness.
• Catch bugs in the mountains. Gain b_i points of happiness.
• 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≤N≤10⁵

• 1 ≤a_i, b_i, c_i≤ 10⁴

Input

N
a₁ b₁ c₁
a₂ b₂ c₂
a₃ b₃ c₃
.
.
.
a_N b_N c_N

Output

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

Example Input - Output

Input
3
10 40 70
20 50 80
30 60 90

Output
210

Explaination

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

Note

This problem is taken from an online judge atcoder. Feel free to try it on your own before moving to solution

Problem link https://atcoder.jp/contests/dp/tasks/dp_c