using System; using System.Collections.Generic; using System.Linq; using System.IO; using System.Threading; using System.Text; using System.Diagnostics; using static util; using P = pair; class Program { static void Main(string[] args) { var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; var solver = new Solver(sw); // var t = new Thread(solver.solve, 1 << 26); // 64 MB // t.Start(); // t.Join(); solver.solve(); sw.Flush(); } } class Solver { StreamWriter sw; Scan sc; void Prt(string a) => sw.WriteLine(a); void Prt(IEnumerable a) => Prt(string.Join(" ", a)); void Prt(params object[] a) => Prt(string.Join(" ", a)); public Solver(StreamWriter sw) { this.sw = sw; this.sc = new Scan(); } public void solve() { // var rnd = new Random(); // int w = 52; int w = sc.Int; if (w <= 2) { Prt(0); return; } var a = new long[w][]; for (int i = 0; i < w; i++) { // a[i] = new long[3]; // for (int j = 0; j < 3; j++) // { // a[i][j] = rnd.Next(); // } a[i] = sc.LongArr; } long ans = 0; { int w1 = w / 2; int w2 = w - w1; var l1 = new List>(); for (int i = 0; i < (1 << w1); i += 2) { if ((i & (i >> 1)) != 0) continue; long x = 0, y = 0; for (int j = 0; j < w1; j++) { // if (j > 0 && ((i >> j) & 1) == 1 && ((i >> (j - 1)) & 1) == 1) { // goto A; // } if (((i >> j) & 1) == 1) { x -= a[j][2]; y += a[j][1]; } else if (j == w1 - 1 || ((i >> (j + 1)) & 1) == 0) { x += a[j][0]; } } l1.Add(new pair(x, y)); // A: continue; } l1.Sort(); l1.Reverse(); var nl1 = new List>(); foreach (var item in l1) { if (nl1.Count == 0 || nl1.Last().v2 < item.v2) { nl1.Add(item); } } l1 = nl1; var l2 = new List>(); for (int i = 0; i < (1 << w2); i += 2) { if ((i & (i >> 1)) != 0) continue; long x = 0, y = 0; for (int j = 0; j < w2; j++) { // if (j > 0 && ((i >> j) & 1) == 1 && ((i >> (j - 1)) & 1) == 1) { // goto A; // } if (((i >> j) & 1) == 1) { x -= a[w1 + j][2]; y += a[w1 + j][1]; } else if (j == w2 - 1 || ((i >> (j + 1)) & 1) == 0) { x += a[w1 + j][0]; } } l2.Add(new pair(x, y)); // A: continue; } l2.Sort(); l2.Reverse(); var nl2 = new List>(); foreach (var item in l2) { if (nl2.Count == 0 || nl2.Last().v2 < item.v2) { nl2.Add(item); } } l2 = nl2; { int j = l2.Count - 1; for (int i = 0; i < l1.Count; i++) { while (j >= 0 && nl1[i].v1 + nl2[j].v1 < 0) { --j; } if (j >= 0) { ans = Math.Max(ans, nl1[i].v2 + nl2[j].v2); } else break; } } } { int w1 = (w - 2) / 2; int w2 = w - 2 - w1; var l1 = new List>(); for (int i = 0; i < (1 << w1); i += 2) { long x = 0, y = 0; for (int j = 0; j < w1; j++) { if (j > 0 && ((i >> j) & 1) == 1 && ((i >> (j - 1)) & 1) == 1) { goto A; } if (((i >> j) & 1) == 1) { x -= a[j][2]; y += a[j][1]; } else if (j == w1 - 1 || ((i >> (j + 1)) & 1) == 0) { x += a[j][0]; } } l1.Add(new pair(x, y)); A: continue; } l1.Sort(); l1.Reverse(); var nl1 = new List>(); foreach (var item in l1) { if (nl1.Count == 0 || nl1.Last().v2 < item.v2) { nl1.Add(item); } } l1 = nl1; var l2 = new List>(); for (int i = 0; i < (1 << w2); i += 2) { long x = 0, y = 0; for (int j = 0; j < w2; j++) { if (j > 0 && ((i >> j) & 1) == 1 && ((i >> (j - 1)) & 1) == 1) { goto A; } if (((i >> j) & 1) == 1) { x -= a[w1 + 2 + j][2]; y += a[w1 + 2 + j][1]; } else if (j == w2 - 1 || ((i >> (j + 1)) & 1) == 0) { x += a[w1 + 2 + j][0]; } } l2.Add(new pair(x, y)); A: continue; } l2.Sort(); l2.Reverse(); var nl2 = new List>(); foreach (var item in l2) { if (nl2.Count == 0 || nl2.Last().v2 < item.v2) { nl2.Add(item); } } l2 = nl2; int mid = w1 + 1; { int j = l2.Count - 1; for (int i = 0; i < l1.Count; i++) { while (j >= 0 && nl1[i].v1 + nl2[j].v1 - a[mid][2] < 0) { --j; } if (j >= 0) { ans = Math.Max(ans, nl1[i].v2 + nl2[j].v2 + a[mid][1]); } else break; } } } Prt(ans); } } class pair : IComparable> { public T v1; public U v2; public pair() : this(default(T), default(U)) {} public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; } public int CompareTo(pair a) { int c = Comparer.Default.Compare(v1, a.v1); return c != 0 ? c : Comparer.Default.Compare(v2, a.v2); } public override string ToString() => v1 + " " + v2; public void Deconstruct(out T a, out U b) { a = v1; b = v2; } } static class util { public static readonly int M = 1000000007; // public static readonly int M = 998244353; public static readonly long LM = 1L << 60; public static readonly double eps = 1e-11; public static void DBG(string a) => Console.Error.WriteLine(a); public static void DBG(IEnumerable a) => DBG(string.Join(" ", a)); public static void DBG(params object[] a) => DBG(string.Join(" ", a)); public static void Assert(bool cond) { if (!cond) throw new Exception(); } public static pair make_pair(T v1, U v2) => new pair(v1, v2); public static int CompareList(IList a, IList b) where T : IComparable { for (int i = 0; i < a.Count && i < b.Count; i++) if (a[i].CompareTo(b[i]) != 0) return a[i].CompareTo(b[i]); return a.Count.CompareTo(b.Count); } public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w; static readonly int[] dd = { 0, 1, 0, -1 }; // static readonly string dstring = "RDLU"; public static P[] adjacents(int i, int j) => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1])).ToArray(); public static P[] adjacents(int i, int j, int h, int w) => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1])) .Where(p => inside(p.v1, p.v2, h, w)).ToArray(); public static P[] adjacents(this P p) => adjacents(p.v1, p.v2); public static P[] adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w); public static Dictionary compress(this IEnumerable a) => a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i); public static Dictionary compress(params IEnumerable[] a) => compress(a.Aggregate(Enumerable.Union)); public static T[] inv(this Dictionary dic) { var res = new T[dic.Count]; foreach (var item in dic) res[item.Value] = item.Key; return res; } public static void swap(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; } public static void swap(this IList a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; } public static T[] copy(this IList a) { var ret = new T[a.Count]; for (int i = 0; i < a.Count; i++) ret[i] = a[i]; return ret; } } class Scan { StreamReader sr; public Scan() { sr = new StreamReader(Console.OpenStandardInput()); } public Scan(string path) { sr = new StreamReader(path); } public int Int => int.Parse(Str); public long Long => long.Parse(Str); public double Double => double.Parse(Str); public string Str => sr.ReadLine().Trim(); public pair Pair() { T a; U b; Multi(out a, out b); return new pair(a, b); } public P P => Pair(); public int[] IntArr => StrArr.Select(int.Parse).ToArray(); public long[] LongArr => StrArr.Select(long.Parse).ToArray(); public double[] DoubleArr => StrArr.Select(double.Parse).ToArray(); public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries); bool eq() => typeof(T).Equals(typeof(U)); T ct(U a) => (T)Convert.ChangeType(a, typeof(T)); T cv(string s) => eq() ? ct(int.Parse(s)) : eq() ? ct(long.Parse(s)) : eq() ? ct(double.Parse(s)) : eq() ? ct(s[0]) : ct(s); public void Multi(out T a) => a = cv(Str); public void Multi(out T a, out U b) { var ar = StrArr; a = cv(ar[0]); b = cv(ar[1]); } public void Multi(out T a, out U b, out V c) { var ar = StrArr; a = cv(ar[0]); b = cv(ar[1]); c = cv(ar[2]); } public void Multi(out T a, out U b, out V c, out W d) { var ar = StrArr; a = cv(ar[0]); b = cv(ar[1]); c = cv(ar[2]); d = cv(ar[3]); } public void Multi(out T a, out U b, out V c, out W d, out X e) { var ar = StrArr; a = cv(ar[0]); b = cv(ar[1]); c = cv(ar[2]); d = cv(ar[3]); e = cv(ar[4]); } }