using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using static System.Console;
using static System.Math;

namespace atcoder
{
    class Program
    {
        static void Main(string[] args)
        {
            //while (true)
                new Program().Solve(new ConsoleInput(In));
        }

        public T Min<T>(params T[] a)
        {
            if (a.Length == 0) return default(T);

            T min = a[0];
            for (int i = 1; i < a.Length; i++)
            {
                if ((dynamic)min > (dynamic)a[i]) min = a[i];
            }
            return min;
        }

        public T Max<T>(params T[] a)
        {
            if (a.Length == 0) return default(T);

            T max = a[0];
            for (int i = 1; i < a.Length; i++)
            {
                if ((dynamic)max < (dynamic)a[i]) max = a[i];
            }
            return max;
        }

        public T Lcm<T>(T a, T b)
        {
            return (dynamic)a * (dynamic)b / Gcd((dynamic)a, (dynamic)b);
        }

        public T Gcd<T>(T a, T b)
        {
            if ((dynamic)a < (dynamic)b)
                return Gcd(b, a);
            while ((dynamic)b != 0)
            {
                var remainder = (dynamic)a % (dynamic)b;
                a = b;
                b = remainder;
            }
            return a;
        }

        public void Solve(ConsoleInput input)
        {
            var n = input.ReadInt;
            var abc = new int[n, 3];
            for (var i = 0; i < n; i++)
            {
                abc[i, 0] = input.ReadInt;
                abc[i, 1] = input.ReadInt;
                abc[i, 2] = input.ReadInt;
            }

            var dp = new int[n + 1, 3];
            for (var i = 0; i < n; i++)
            {
                dp[i + 1, 0] = Max(abc[i, 1] + dp[i, 1], abc[i, 2] + dp[i, 2]);
                dp[i + 1, 1] = Max(abc[i, 0] + dp[i, 0], abc[i, 2] + dp[i, 2]);
                dp[i + 1, 2] = Max(abc[i, 1] + dp[i, 1], abc[i, 0] + dp[i, 0]);
            }

            WriteLine($"{Max(dp[n, 0], dp[n, 1], dp[n, 2])}");
        }
    }

    public class ConsoleInput
    {
        private readonly System.IO.TextReader _stream;
        private readonly char _separator;
        private Queue<string> inputStream;
        public ConsoleInput(System.IO.TextReader stream, char separator = ' ')
        {
            _separator = separator;
            _stream = stream;
            inputStream = new Queue<string>();
        }
        public string Read
        {
            get
            {
                if (inputStream.Count != 0) return inputStream.Dequeue();
                string[] tmp = _stream.ReadLine().Split(_separator);
                for (int i = 0; i < tmp.Length; ++i)
                    inputStream.Enqueue(tmp[i]);
                return inputStream.Dequeue();
            }
        }
        public string ReadLine { get { return _stream.ReadLine(); } }
        public int ReadInt { get { return int.Parse(Read); } }
        public long ReadLong { get { return long.Parse(Read); } }
        public double ReadDouble { get { return double.Parse(Read); } }
        public string[] ReadStrArray(long N) { var ret = new string[N]; for (long i = 0; i < N; ++i) ret[i] = Read; return ret; }
        public int[] ReadIntArray(long N) { var ret = new int[N]; for (long i = 0; i < N; ++i) ret[i] = ReadInt; return ret; }
        public long[] ReadLongArray(long N) { var ret = new long[N]; for (long i = 0; i < N; ++i) ret[i] = ReadLong; return ret; }
    }
}


Measured memory_bytes: 29772