#include //typedef //-------------------------#include const double pi = 3.141592653589793238462643383279; using namespace std; //conversion //------------------------------------------ inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; } template inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); } inline int readInt() { int x; scanf("%d", &x); return x; } //typedef //------------------------------------------ typedef vector VI; typedef vector VVI; typedef vector VS; typedef pair PII; typedef pair PLL; typedef pair TIII; typedef long long LL; typedef unsigned long long ULL; typedef vector VLL; typedef vector VVLL; //container util //------------------------------------------ #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(), (a).rend() #define PB push_back #define MP make_pair #define SZ(a) int((a).size()) #define SQ(a) ((a)*(a)) #define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i) #define EXIST(s,e) ((s).find(e)!=(s).end()) #define SORT(c) sort((c).begin(),(c).end()) //repetition //------------------------------------------ #define FOR(i,s,n) for(int i=s;i<(int)n;++i) #define REP(i,n) FOR(i,0,n) #define MOD 1000000007 #define rep(i, a, b) for(int i = a; i < (b); ++i) #define trav(a, x) for(auto& a : x) #define all(x) x.begin(), x.end() #define sz(x) (int)(x).size() typedef long long ll; typedef pair pii; typedef vector vi; const double EPS = 1E-8; #define chmin(x,y) x=min(x,y) #define chmax(x,y) x=max(x,y) class UnionFind { public: vector par; vector siz; UnionFind(int sz_): par(sz_), siz(sz_, 1) { for (ll i = 0; i < sz_; ++i) par[i] = i; } void init(int sz_) { par.resize(sz_); siz.assign(sz_, 1LL); for (ll i = 0; i < sz_; ++i) par[i] = i; } int root(int x) { while (par[x] != x) { x = par[x] = par[par[x]]; } return x; } bool merge(int x, int y) { x = root(x); y = root(y); if (x == y) return false; if (siz[x] < siz[y]) swap(x, y); siz[x] += siz[y]; par[y] = x; return true; } bool issame(int x, int y) { return root(x) == root(y); } int size(int x) { return siz[root(x)]; } }; ll modPow(ll x, ll n, ll mod = MOD){ ll res = 1; while(n){ if(n&1) res = (res * x)%mod; res %= mod; x = x * x %mod; n >>= 1; } return res; } #define SIEVE_SIZE 5000000+10 bool sieve[SIEVE_SIZE]; void makeSieve(){ for(int i=0; i vec; typedef vector mat; mat mul(mat &A, mat &B) { mat C(A.size(), vec((int)B[0].size())); for(int i=0; i 0) { if(n & 1) B = mul(B, A); A = mul(A, A); n >>= 1; } return B; } map prime_factor(ll n) { map res; for(ll i=2; i*i <= n; i++) { while(n%i == 0) { res[i]++; n /= i; } } if(n != 1) res[n] = 1; return res; } struct Node { int mi, mx; Node(int mi, int mx) : mi(mi), mx(mx) {} Node(){} } seg[1<<23]; void update(int i, int x){ i += (1<<22)-1; seg[i].mi = seg[i].mx = x; while(i > 0){ i = (i-1)/2; seg[i].mi = min(seg[i*2+1].mi, seg[i*2+2].mi); seg[i].mx = max(seg[i*2+1].mx, seg[i*2+2].mx); } } Node query(int a, int b, int k=0, int l=0, int r = (1<<22)){ if(r <= a || b <= l) return Node(INT_MAX, -INT_MAX); if(a <= l && r <= b) return seg[k]; else{ Node vl = query(a, b, k*2+1, l, (l+r)/2); Node vr = query(a, b, k*2+2, (l+r)/2, r); return Node(min(vl.mi, vr.mi), max(vl.mx, vr.mx)); } } int dp[(1<<16)][16][3]; int main() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(12); int N; cin >> N; vector a(N), b(N), c(N); REP(i,N) cin >> a[i] >> b[i] >> c[i]; //iを選んでおり, 最後に選んだのがj, 下面が0 AB, 1 AC, 2 BCのとき for(int i=0; i b2 && c1 > c2) || (b1 > c2 && c1 > b2)){ chmax(dp[bit | (1< b2 && c1 > a2) || (b1 > a2 && c1 > b2)){ chmax(dp[bit | (1< a2 && c1 > c2) || (b1 > c2 && c1 > a2)){ chmax(dp[bit | (1< b2 && c1 > c2) || (a1 > c2 && c1 > b2)){ chmax(dp[bit | (1< b2 && c1 > a2) || (a1 > a2 && c1 > b2)){ chmax(dp[bit | (1< a2 && c1 > c2) || (a1 > c2 && c1 > a2)){ chmax(dp[bit | (1< b2 && a1 > c2) || (b1 > c2 && a1 > b2)){ chmax(dp[bit | (1< b2 && a1 > a2) || (b1 > a2 && a1 > b2)){ chmax(dp[bit | (1< a2 && a1 > c2) || (b1 > c2 && a1 > a2)){ chmax(dp[bit | (1<