#include <bits/stdc++.h>
using namespace std;
using LL = long long int;
#define incID(i, l, r) for(int i = (l)    ; i <  (r); ++i)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); --i)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); ++i)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); --i)
#define inc(i, n)  incID(i, 0, n)
#define dec(i, n)  decID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec1(i, n) decII(i, 1, n)
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define FR front()
#define BA back()
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
auto setmin   = [](auto & a, auto b) { return (b <  a ? a = b, true : false); };
auto setmax   = [](auto & a, auto b) { return (b >  a ? a = b, true : false); };
auto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };
auto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };
#define SI(v) static_cast<int>(v.size())
#define RF(e, v) for(auto & e: v)
#define until(e) while(! (e))
#define if_not(e) if(! (e))
#define ef else if
#define UR assert(false)
#define IN(T, ...) T __VA_ARGS__; IN_(__VA_ARGS__);
void IN_() { };
template<typename T, typename ... U> void IN_(T & a, U & ... b) { cin >> a; IN_(b ...); };
template<typename T> void OUT(T && a) { cout << a << endl; }
template<typename T, typename ... U> void OUT(T && a, U && ... b) { cout << a << " "; OUT(b ...); }

// ---- ----

template<typename T> istream & operator>>(istream & s, vector<T> & v) { RF(e, v) { s >> e; } return s; }
template<typename T> ostream & operator<<(ostream & s, vector<T> const & v) {
	inc(i, SI(v)) { s << (i == 0 ? "" : " ") << v[i]; }
	return s;
}

template<typename T> T MV(T v) { return v; }
template<typename T, typename ... U> auto MV(T v, int a, U ... b) { return vector<decltype(MV(v, b ...))>(a, MV(v, b ...)); }

#define bit(b, i) (((b) >> (i)) & 1)
#define PC __builtin_popcountll
#define BL(a) (a ? 64 - __builtin_clzll(a) : 0)

int main() {
	IN(int, n);
	auto v = MV(0, n, 3);
	cin >> v;
	RF(e, v) { sort(ALL(e)); }
	
	auto ok = MV<bool>(false, n, n, 3, 3);
	inc(i, n) {
	inc(j, n) {
		inc(k, 3) {
		inc(l, 3) {
			vector<int> x, y;
			inc(m, 3) { if(m != k) { x.PB(v[i][m]); } }
			inc(m, 3) { if(m != l) { y.PB(v[j][m]); } }
			ok[i][j][k][l] = (x[0] >= y[0] && x[1] >= y[1]);
		}
		}
	}
	}
	
	auto dp = MV(0, 1 << n, n, 3);
	int ans = 0;
	inc(b, 1 << n) {
	inc(i, n) { if(b != 0 && bit(b, i) == 0) { continue; }
	inc(k, 3) {
		setmax(ans, dp[b][i][k]);
		inc(j, n) { if(bit(b, j) == 1) { continue; }
		inc(l, 3) {
			if(ok[i][j][k][l]) {
				setmax(dp[b | (1 << j)][j][l], dp[b][i][k] + v[j][l]);
			}
		}
		}
	}
	}
	}
	OUT(ans);
}